Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1069
| Title: | The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard | Authors: | Cheng, TCE Ng, CTD Yuan, JJ |
Issue Date: | Sep-2003 | 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. | Keywords: | Scheduling Batching Due-dates Maximum lateness Multi-operation jobs |
Publisher: | Springer | Journal: | Journal of scheduling | ISSN: | 1094-6136 | EISSN: | 1099-1425 | DOI: | 10.1023/A:1024858623282 | 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: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| multi_operation.pdf | Pre-published version | 162.19 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
95
Last Week
1
1
Last month
Citations as of Apr 28, 2024
Downloads
103
Citations as of Apr 28, 2024
SCOPUSTM
Citations
21
Last Week
0
0
Last month
1
1
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
21
Last Week
1
1
Last month
0
0
Citations as of May 2, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.