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.
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
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.
DownLoad: