Please use this identifier to cite or link to this item:
Title: Parallel machine scheduling with batch setup times
Authors: Cheng, TCE 
Chen, ZL
Issue Date: 1994
Publisher: Institute for Operations Research and the Management Sciences
Source: Operations research, 1994, v. 42, no. 6, p. 1171-1174 How to cite?
Journal: Operations research 
Abstract: 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.
ISSN: 0030-364x
EISSN: 1526-5463
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Jan 15, 2019

Page view(s)

Last Week
Last month
Citations as of Jan 14, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.