极小化延误工件个数的单机分组排序问题

刘朝晖

刘朝晖. 极小化延误工件个数的单机分组排序问题[J]. 华东理工大学学报（自然科学版）, 1997, (5): 626-631.

引用本文:

刘朝晖. 极小化延误工件个数的单机分组排序问题[J]. 华东理工大学学报（自然科学版）, 1997, (5): 626-631.

Liu Zhaohui *. One machine Scheduling with Batching: the Late Job Number Problem[J]. Journal of East China University of Science and Technology, 1997, (5): 626-631.

Citation:

Liu Zhaohui *. One machine Scheduling with Batching: the Late Job Number Problem[J]. Journal of East China University of Science and Technology, 1997, (5): 626-631.

极小化延误工件个数的单机分组排序问题

刘朝晖

One machine Scheduling with Batching: the Late Job Number Problem

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.

HTML全文

参考文献(0)

资源附件(0)

/