Research Of Moving Integrated Scheduling Procedures With Setup Times Forward

The demand in personalized products of people is increasing with thedevelopment of society devices that one kind of product has many types ofpersonalized products. In order to improve production efficiency, the processes ofdifferent types of personalized products need to have a different processing sequence,the products’ different procedures order have important implications on the finalcompletion time, and the final completion time has a direct impact on productionefficiency.About product procedures’ scheduling algorithm, there mainly include theflow-shop scheduling algorithm, job-shop scheduling algorithm and the integratedscheduling algorithm. Flow-shop scheduling algorithm and job-shop schedulingalgorithm mainly solve the procedures with pure processing and pure assemblyscheduling problem. Integrated scheduling algorithm is to solve the schedulingproblem with processing and assembly.In this paper, the scheduling problem with setup times is on the basis of theintegrated problem considering the setup times in procedures, and the multifunctiondevice adjust cutters produce the setup times, and the setup times are differentbetween different devices and different procedures types.Currently, Existing researchresults about integrated scheduling problem with setup times firstly use the existingintegrated scheduling algorithm to determine the procedures order, and then processthe procedures in the devices, as the same time dynamically insert the setup timesbetween procedures. These reduce the complexity of the scheduling algorithm andalso avoid the repeatedly moving, which provide a good idea to solve the integratedscheduling problem with setup times.However, the above scheduling algorithm doesn’t consider between differentkinds of procedures with different setup times. About this problems, We firstlyadvance the last end time of the adjustment procedures through the adjustment of theprocedures sequence and chang the setup times, which ensure that tight procedures ofdevices and tight procedures of technology are not after the shift, and then advance procedures from different ranges, they are procedures which have lower priority thancurrent adjustment priority procedures and have been made forword based onproceduer forward scheme, procedures which have same have priority with currentadjustment priority procedures and lower priority than current adjustment priorityprocedures and have been made forword based on proceduer forward scheme andproceduer forward scheme with same priority; and all procedures which have beenmade forword based on proceduer forward scheme and adjustment procedureforward once strategy. The above three different algorithms which formed fromadvancing different priority rangs procedures realize better scheduling results and begood control of the complexity of the algorithm. These have some theoretical andpractical value.