本文处理在平行机台上调度具有单一模具约束的成组工作，以最小化总拖期量的问题．研究了最优解的性质，并提出了分枝定界法、启发式算法、多阶段ｔａｂｕｓｅａｒｃｈ 算法及组合方法．利用随机问题对各算法进行了对比和分析，获得有实践指导意义的结果 This paper addresses the problem of scheduling a group work with a single die constraint on a parallel machine to minimize the total amount of drag. The properties of the optimal solution are studied, and branch-and-bound method, heuristic algorithm, multi-stage tabusearch algorithm and combination method are proposed. The algorithms are compared and analyzed using stochastic problems to obtain practical and instructive results