Please use this identifier to cite or link to this item:
|Title:||The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard|
|Authors:||Cheng, T. C. Edwin|
Ng, Chi-to Daniel
Yuan, J. J.
|Publisher:||Kluwer Academic Publishers (Springer Netherlands)|
|Source:||Journal of scheduling, Sept. 2003, v. 6, no. 5, p. 483-490.|
|Abstract:||In this paper, we consider the single machine batching problem with family setup times to minimize maximum lateness. While the problem was proved to be binary NP-hard in 1978, whether the problem is strongly NP-hard is a long-standing open question. We show that this problem is strongly NP-hard.|
|Description:||Published article at http://dx.doi.org/10.1023/A:1024858623282|
|Rights:||Journal of Scheduling © 2003 Kluwer Academic Publishers (Springer). The original publication is available at www.springerlink.com.|
|Appears in Collections:||LMS Journal/Magazine Articles|
Files in This Item:
|multi_operation.pdf||Pre-published version||162.19 kB||Adobe PDF||View/Open|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.