Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/18916
DC FieldValueLanguage
dc.contributorDepartment of Management and Marketing-
dc.creatorCheng, TCE-
dc.creatorLiu, ZH-
dc.creatorShafransky, YM-
dc.date.accessioned2015-04-29T07:26:21Z-
dc.date.available2015-04-29T07:26:21Z-
dc.identifier.issn1094-6136-
dc.identifier.urihttp://hdl.handle.net/10397/18916-
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectFamily schedulingen_US
dc.subjectNumber of late jobsen_US
dc.subjectStrong NP-hardnessen_US
dc.titleA note on the complexity of family scheduling to minimize the number of late jobsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage225-
dc.identifier.epage229-
dc.identifier.volume4-
dc.identifier.issue4-
dcterms.abstractThe single-machine family scheduling problem of minimizing the number of late jobs has been known to be NP-hard, but whether it is NP-hard in the strong sense is cited as an open problem in several reviews. In this note, we prove that this problem is strongly NP-hard even if all set-up times and processing times are one unit.-
dcterms.bibliographicCitationJournal of scheduling, 2001, v. 4, no. 4, p. 225-229-
dcterms.isPartOfJournal of scheduling-
dcterms.issued2001-
dc.identifier.isiWOS:000171079500004-
dc.identifier.eissn1099-1425-
dc.identifier.rosgroupidr01437-
dc.description.ros2000-2001 > Academic research: refereed > Publication in refereed journal-
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Oct 23, 2020

Page view(s)

204
Last Week
0
Last month
Citations as of Oct 21, 2020

Google ScholarTM

Check


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