Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1069
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Cheng, TCE | - |
dc.creator | Ng, CTD | - |
dc.creator | Yuan, JJ | - |
dc.date.accessioned | 2014-12-11T08:22:31Z | - |
dc.date.available | 2014-12-11T08:22:31Z | - |
dc.identifier.issn | 1094-6136 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1069 | - |
dc.description | Published article at http://dx.doi.org/10.1023/A:1024858623282 | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.rights | Journal of Scheduling © 2003 Kluwer Academic Publishers (Springer). The original publication is available at www.springerlink.com. | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Batching | en_US |
dc.subject | Due-dates | en_US |
dc.subject | Maximum lateness | en_US |
dc.subject | Multi-operation jobs | en_US |
dc.title | The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.description.otherinformation | Author name used in this publication: T. C. E. Cheng | en_US |
dc.description.otherinformation | Author name used in this publication: C. T. Ng | en_US |
dc.identifier.spage | 483 | - |
dc.identifier.epage | 490 | - |
dc.identifier.volume | 6 | - |
dc.identifier.issue | 5 | - |
dc.identifier.doi | 10.1023/A:1024858623282 | - |
dcterms.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. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Journal of scheduling, Sept. 2003, v. 6, no. 5, p. 483-490 | - |
dcterms.isPartOf | Journal of scheduling | - |
dcterms.issued | 2003-09 | - |
dc.identifier.isi | WOS:000221413100004 | - |
dc.identifier.scopus | 2-s2.0-3543134230 | - |
dc.identifier.eissn | 1099-1425 | - |
dc.identifier.rosgroupid | r19914 | - |
dc.description.ros | 2003-2004 > Academic research: refereed > Publication in refereed journal | - |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
dc.description.pubStatus | Published | en_US |
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 |
Page views
93
Last Week
1
1
Last month
Citations as of Apr 14, 2024
Downloads
101
Citations as of Apr 14, 2024
SCOPUSTM
Citations
21
Last Week
0
0
Last month
1
1
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
21
Last Week
1
1
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.