Integrated Scheduling Algorithm Of Subtree Level Considering The Consumption

With the constant expansion of single complex product demand,considerable progress has been made in the research of shortening the processing time,especially the proposal of integrated scheduling has brought new thinking to the manufacturing industry.Although many achievements have been made in the field of integrated scheduling,these algorithms haven't solved this problem about both efficiency and intermediate expense with subtree level.To solve the problem that the expense of intermediate products will increase with the waiting time if the intermediate products are not assembled immediately after they have been processed,an integrated scheduling algorithm considering subtree level is proposed for the first time.The proposed subtree scheduling strategy is used to solve the problem of processing priority among the same equipment processes,and the proposed initial scheduling scheme is established to control the expense in the subtree.According to the initial scheduling scheme,the close processing strategy and the minimum expense strategy are adopted.For the processes with the same expense,the processes with earlier scheduling points are preferentially scheduled to reduce the free time of the equipment.The example shows that the algorithm can improve the processing efficiency and reduce the expense.For the problem that the general integrated scheduling method above is based on rules and the diversity of scheduling schemes affects the selection of optimal schemes,a hybrid integrated scheduling algorithm based on influencing process diagram is proposed.The algorithm uses constraint signal to arrange the processing order scheduled on the same equipment to generate feasible solutions quickly.A directed graph is established to reflect the distribution characteristics of the special processes and their relative processes.Each directed acyclic path in the graph described one processing time characteristics of processes.The scheduling order of the initial solution is rearranged according to the adjustment strategy specified by the path of the diagram to optimize the initial scheduling solution.To reduce the complexity of annealing process,this annealing model analyses the issue before disturbance to reduce redundant steps for those solutions that may produce poor scheduling results.To optimize the algorithm considering the subtree level based on the diagram supported above,a hybrid integrated algorithm is proposed based on the process diagram optimization model proposed above.An integrated scheduling algorithm for subtree level is used as the initial scheduling scheme optimized.A special simulated annealing model is used to enlarge the feasible solution space of the scheduling solutions to reduce unnecessary disturbance operation while searching for a better solution.Instance shows that this algorithm inherits the advantages of the two algorithms,effectively reduces the intermediate expense of initial solution and improves the processing efficiency.It has fewer iterations and faster local convergence than other intelligent algorithms.This paper focuses on the influence of subtree level on process scheduling results and solves the double purposes for processing time and intermediate expense simultaneously.A special simulated annealing model is designed and combined with an improved subtree level strategy to optimize the initial scheduling results.The instance shows that the subtree level policy scheduling process has good feedback in solving double purposes problems and combining with intelligent algorithms.