使用链表求解Job-shop调度问题的算法

A Job-shop Scheduling Algorithm Using Chained List

根据Ｊｏｂ－ｓｈｏｐ调度问题的特点，提出了一种新的求解Ｊｏｂ－ｓｈｏｐ调度问题的算法．经分析及实验验证，利用这种算法求解 Ｊｏｂ－ｓｈｏｐ调度问题，在保证工件加工顺序的前提下可使工件的加工周期最短．

The study of Job-shop scheduling algorithm is not only a supplementary of the scheduling theory, but also has great influence on modernization management in the enterprises with single item, variety products, small batch production mode. This paper presents a new scheduling algorithm of solving Job-shop problems, according to the characteristic of Job-shop scheduling algorithm. Through analyzing and really verifying, the Job-shop scheduling results are very satisfactory.