PARALLEL MACHINE SCHEDULING WITH BATCH SETUP TIMES
成果类型：
Note
署名作者：
CHENG, TCE; CHEN, ZL
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.42.6.1171
发表日期：
1994
页码：
1171-1174
关键词：
摘要：
We consider a problem of scheduling several batches of jobs on two identical parallel machines to minimize the total completion time of jobs. A setup time is incurred whenever there is a switch from processing a job in one batch to a job in another batch. When the number of jobs is arbitrary, the computational complexity of the problem is posed as an open problem in the literature. We show in this note that the problem is binary NP-hard even when the setup times are sequence independent and all processing times are equal.