Research Of Integrated Scheduling Algorithm Based On Dynamic Essential Short Path By Device Driver

Integrated scheduling is mainly study on how to make processing andassembling of complex single products efficiently parallel processed. Researchesrelated to the integrated scheduling problem have both theoretic value andpractical value.For general integrated scheduling problem, aiming at the problem that theintegrated scheduling algorithm based on event driven by machines’ idlescheduling the procedure whose father node has the longest path length whenschedulable procedures are not unique, without considering the essential longpath being formed by serial processing of procedures on the same device, whichwill prolong the product processing time and affect the scheduling results. Theintegrated scheduling algorithm based on dynamic essential short path by devicedriver has been proposed. At the device driver moment, the schedulableprocedure that is in the essential short path has been scheduled through using idledevice driver, which can efficiently solve the problem that a large number ofprocedures being serial processed on the same device.For integrated flexible scheduling problem, aiming at the problem that thestatic overlap time may not necessarily be overlapped in practical processingprocess, which may lead the effect of parallel processing not ideal, the dynamicparallel integrated flexible scheduling algorithm based on device driver anddynamic essential path has been proposed. The algorithm firstly selects planprocessing device for procedures according to short time strategy to preliminarynarrow down the selection scope of procedures’ processing device. Then idledevice driver strategy has been adopted to confirm procedures which can beparallel processed, and processing device for these parallel processed procedureshas been confirmed through the proposed algorithm of the parallel optimizationallocation strategies and the earliest processing end strategy; When a free machine has more than one schedulable procedure and all of these schedulableprocedures can only serial processing on this machine, scheduling the procedureaccording to dynamic essential short path strategy in order to avoid theappearance of much longer essential path on these machines.For integrated flexible scheduling problem, aiming at the problem that whena procedure can be processed on multi-machines with the shortest processingtime, only using short time strategy is easy to lead the problem of the allocationof processing machine are not reasonable, the conflict mediation integratedscheduling algorithm based on essential short path and device driver is proposed.The algorithm firstly selects plan processing device for procedures according toshort time strategy; then the idle device driver strategy has been adopted, at lastthe dynamic essential short path strategy and the conflict mediation paralleloptimization strategy first proposed in this paper has been adopted. The proposedalgorithm can solve the serial processing of procedures on the same device, andmeanwhile make the procedures being allocated to each idle machine is short onthe whole.Aiming at the general integrated scheduling problem and the integratedflexible scheduling problem, and starting from the idle device driver strategy andthe dynamic essential short path strategy, the algorithms proposed in this paperrealize fully parallel processing of procedures, examples analysis has shown thatthe proposed algorithm can improve the efficiency of product manufacturing.