遗传算法的双向车间作业调度算法研究

THE Study of Planning and Bi-directional Job-shep Scheduling Based on the Genetic Algorithm

将双向调度思想应用于作业车间调度,得到一种新调度算法。算法中关键零件采用反向调度,尽可能地满足交货期要求,一般零件采用前向调度方法,最大效率地利用车间资源,尽可能早完工。利用遗传算法的全局搜索特性,得到最佳的调度结果。

A new approach is developed combining the genetic algorithm with a bi-directional approach. The critical jobs must be scheduled by the backward algorithm, which ensures the necessary resources allocated to the most important jobs; then the remaining jobs are scheduled with a forward algorithm, which tends to allocate resources where the previous scheduling pass did not use them. The genetic algorithm derives the optimal operations precedence to schedule the operations in the bi-directional scheduling approach.