关键词: 动态调度算法, 拟关键路径法, 最佳适应调度法, 关键设备

Abstract: The dynamic scheduling problem of processing electric machines with different start time is discussed. Operations of a processing tree are classified into dependent operations with either a predecessor or a successor and independent operations. The pseud critical path method (PCPM) is presented for the dependent operations and the best fit scheduling method (BFSM) is presented for the independent operations. Operations on critical machines are tightened to minimize idles. Combining PCPM and BFSM, a dynamic scheduling algorithm (DSA) is introduced for multiple products. At last the instance shows that the make span of DSA is shorter than that of a general heuristic algorithm.

Key words: dynamic scheduling algorithm, pseud critical path method, best fit scheduling method, critical machine