An Algorithm Of Integrated Flexible Scheduling By Determine Equipments Dynamically

With the development of market economy, optimizing production scheduling by using computer aided manufacturing is made more and more attention. But most production scheduling is limited processing of pure process or pure assembly in flow line. In the age of for customers to create personalized products, considering integrated scheduling with multi-species and few quantities becomes necessity. In this paper, integrated flexible scheduling problem, integrated scheduling with no-wait constraint between processes and integrated flexible scheduling with no-wait constraint between processes are studied, which considers the condition that processes could be processed on multi-equipments and the condition of the special constraint between processes. So it has certain theoretical and practical significance.For the integrated flexible scheduling problem of complex product, this paper presents an integrated flexible scheduling algorithm of processing and assembling by determining equipments dynamically which can advance the finishing time of processes. A flexible processing tree is built in this algorithm to expand the range of equipments selection. The adaptive and flexible scheduling strategy is adopted to select equipments dynamically. So processes can be finished earliest and the total working hours can be shortened.For the integrated scheduling problem with no-wait constraint between processes, a method to make operation group with No-wait constraint into linkage and integrated scheduling is proposed. The algorithm using the existing expansion processing tree which makes the process with No-wait constraint into group, according to the path of the processes with No-wait constraint of the number determine the order of the process scheduling. Use the first fit scheduling method (FFSM) to process the standard processes and the operation groups with No-wait constraint, which avoid secondary adjustments and reduce the complexity.For the integrated flexible scheduling problem with no-wait constraint between processes, an algorithm which makes the process with no-wait constraint and the former processes into a virtual node is proposed. The allied critical path method and the adaptive and flexible scheduling strategy are adopted to scheduling the standard flexible process. And the shortest processing time scheduling strategy is used to scheduling the flexible process with no-wait constraint to obtain the linkage scheduling.The corresponding algorithms are proposed to solve the integrated flexible scheduling problem of complex product, the integrated scheduling problem with no-wait constraint between processes and the integrated flexible scheduling problem with no-wait constraint between processes. Analysis and examples show that the algorithms have the lower complexity and easy to obtain. Therefore, the algorithms have value of practice and theory.