【摘要】 所描述的问题为在平行机台上具有单一模具约束的调度问题，以实现最小化拖期和为目标·描述了该问题的数学模型，并提出了如下的启发式算法，依据模具成组构成工作表，在对工作指派时根据一定条件允许改变工作的指派顺序，最后运用启发式算法 Ｎ Ｂ Ｒ（ Ｎｅｔ Ｂｅｎｅｆｉｔ ｏｆ Ｒｅｌｏｃａｔｉｏｎ） 对调度方案进行局部调整以减少拖期和·通过一个应用实例，测试了该算法的有效性·更多还原

【Abstract】 This paper addresses the problem of scheduling n grouped jobs on m identical parallel machines with objective of minimizing the sum tardiness, subject to the constraints that each model number is only one and has different matching with each machine. A heuristic approach based on list scheduling was presented. Some conditions were presented which can break the sequence of assigning jobs. This approach was tested to be satisfactory.更多还原