Note on ‘parallel machine scheduling with batch setup times’

Note on ‘parallel machine scheduling with batch setup times’

0.00 Avg rating—0 Votes
Article ID: iaor19991788
Country: United States
Volume: 46
Issue: 3
Start Page Number: 423
End Page Number: 423
Publication Date: May 1998
Journal: Operations Research
Authors:
Keywords: computational analysis
Abstract:

Cheng and Chen use a high-multiplicity encoding scheme to prove binary NP-hardness of a scheduling problem. From this they infer a similar result for a well-known, more general problem. We explain that, although their initial proof is correct, their inference about the more general problem is not.

Reviews

Required fields are marked *. Your email address will not be published.