Flexible integrated scheduling algorithm base on static processing time

Abstract

Aiming at the problem that the existing flexible integrated scheduling algorithms select the processing equipment of the procedure by short-time strategy, which may cause the procedures on the same equipment for a long serial processing time, to extend product completion time, the paper presents an step-by-step type integrated flexible scheduling algorithm based on static processing time. For the process equipment allocation problem, this algorithm, first, adopts short-time strategy to select the planned processing equipment for the procedure, then calculates all the static idle time period and static overlap of processing equipment separately. Some procedures in the overlapping part will be adjusted to the idle time of other equipment; then determine the final processing equipment. For procedure scheduling problem, determine the scheduling order of procedures by the allied critical path method, and finally generate Gantt chart. Examples show that the algorithm can reduce serial processing time of the procedures on the same equipment, increase the parallel processing time between procedures, and make product complete earlier without increasing algorithm complexity.