单一模具约束的平行机台成组工作调度方法(英文)  

Schedule Grouped Jobs on Parallel Machines with Single Mold Constraint 

作　　者：高林[1] 汪定伟[2] 王书宁[1] 

机构地区：[1]清华大学自动化系,北京100084 [2]东北大学信息科学与工程学院,沈阳110006

出　　处：《控制理论与应用》1999年第6期783-787,792,共6页Control Theory & Applications

摘　　要：本文处理在平行机台上调度具有单一模具约束的成组工作，以最小化总拖期量的问题．研究了最优解的性质，并提出了分枝定界法、启发式算法、多阶段ｔａｂｕｓｅａｒｃｈ 算法及组合方法．利用随机问题对各算法进行了对比和分析。This paper addresses the problem of scheduling n grouped jobs on m identical parallel machines to minimize the total tardiness, subject to single mold constraint. For this problem, there is an optimal solution without machine idle. Thus, the scale of searching for optimal solution is reduced. Branch and bound algorithm, run based heuristic, multi stage tabu search and a combined algorithm are proposed and compared in simulation experiments. Some practically useful results are obtained.

关 键 词：生产调度 平行机台 成组技术 最优化问题 

分 类 号：O224[理学—运筹学与控制论]