| 极小化延误工件个数的单机分组排序问题 |
| |
| 引用本文： | 刘朝晖.极小化延误工件个数的单机分组排序问题[J].华东理工大学学报(自然科学版),1997,23(5):626-631. |
| |
| 作者姓名： | 刘朝晖 |
| |
| 作者单位： | 华东理工大学应用数学研究所 |
| |
| 摘 要： | 研究了以极小化延误工件个数为目标的单机分组排序问题，证明了该问题是强ＮＰ困难的，甚至限定所有工件有单位加工时间和一致的组间调整时间也是如此。
|
| 关 键 词： | 分组排序 单台机器 延误工件个数 复杂性 排序 |
One machine Scheduling with Batching: the Late Job Number Problem |
| |
| Liu Zhaohui.One machine Scheduling with Batching: the Late Job Number Problem[J].Journal of East China University of Science and Technology,1997,23(5):626-631. |
| |
| Authors: | Liu Zhaohui |
| |
| Institution: | Liu Zhaohui * |
| |
| Abstract: | This paper considers the one machine scheduling with batching to minimize the number of late jobs. The problem is proven to be strongly NP hard even if every job has unit processing time and all batches have an identical set up time. |
| |
| Keywords: | scheduling with batching single machine number of late jobs complexity strongly NP hardness |
| 本文献已被 CNKI 维普 等数据库收录！ |
