【摘要】 所描述的问题为在平行机台上调度具有单一模具约束的成组工作，以实现最小化总拖期量为目标。描述了该问题的数学模型，并提出了基于运行的启发式算法。利用几组随机问题和一个应用实例，测试了该算法的有效性。更多还原

【Abstract】 This paper addresses the problem of scheduling n grouped jobs on m identical parallel machines with objective of minimizing the total tardiness penalties, subject to single mould constraint. The integrate program model and a run-based heuristic approach that requires the implementing time O(mn+nlogn) are presented. The results show that it can get satisfactorty solutions.更多还原