| 引用本文: | 高 林，汪定伟，王书宁.单一模具约束的平行机台成组工作调度方法[J].控制理论与应用,1999,16(6):783~787.[点击复制] |
| Gao Lin，Wang Dingwei，Wang Shuning.Schedule Grouped Jobs on Parallel Machines with Single Mold Constraint*[J].Control Theory and Technology,1999,16(6):783~787.[点击复制] |
|
| 单一模具约束的平行机台成组工作调度方法 |
| Schedule Grouped Jobs on Parallel Machines with Single Mold Constraint* |
| 摘要点击 789 全文点击 383 投稿时间：1998-07-16 修订日期：1999-07-07 |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| DOI编号 |
| 1999,16(6):783-787 |
| 中文关键词 生产调度 平行机台 成组技术 |
| 英文关键词 production scheduling parallel machine group technology |
| 基金项目 |
|
| 中文摘要 |
| 本文处理在平行机台上调度具有单一模具约束的成组工作，以最小化总拖期量的问题，研究了最优解的性质，并提出了分枝定界法、启发式算法、多阶段tabu search算法及组合方法，利用随机问题对各算法进行了对比和分析，获得有实践指导意义的结果． |
| 英文摘要 |
| 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. |
|
|
|
|
|