Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/661
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorYuan, JJ-
dc.creatorCheng, TCE-
dc.creatorNg, CTD-
dc.date.accessioned2014-12-11T08:27:31Z-
dc.date.available2014-12-11T08:27:31Z-
dc.identifier.issn0377-2217-
dc.identifier.urihttp://hdl.handle.net/10397/661-
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.rightsEuropean Journal of Operational Research © 2006 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.en_US
dc.subjectSchedulingen_US
dc.subjectSingle-variable-resourceen_US
dc.subjectTotal weighted completion timeen_US
dc.subjectNP-hardnessen_US
dc.titleNP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion timeen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage631-
dc.identifier.epage633-
dc.identifier.volume178-
dc.identifier.issue2-
dc.identifier.doi10.1016/j.ejor.2006.02.014-
dcterms.abstractBaker and Nuttle [K.R. Baker, H.L.W. Nuttle, Sequencing independent jobs with a single resource, Naval Research Logistics Quarterly 27 (1980) 499–510] studied the following single-variable-resource scheduling problem: sequencing n jobs for processing by a single resource to minimize a function of job completion times, when the availability of the resource varies over time. When the objective function to be minimized is the total weighted completion time, Baker and Nuttle conjectured that the problem is NP-hard. We show in this note that the conjecture is true.-
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationEuropean journal of operational research, 16 Apr. 2007, v. 178, no. 2, p. 631-633-
dcterms.isPartOfEuropean journal of operational research-
dcterms.issued2007-04-16-
dc.identifier.isiWOS:000242726800023-
dc.identifier.scopus2-s2.0-33750989641-
dc.identifier.eissn1872-6860-
dc.identifier.rosgroupidr30618-
dc.description.ros2006-2007 > Academic research: refereed > Publication in refereed journal-
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberOA_IR/PIRAen_US
dc.description.pubStatusPublisheden_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
NP_HARD(Conjecture)_Final.pdfPre-published version106.95 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

90
Last Week
0
Last month
Citations as of Jul 3, 2022

Downloads

162
Citations as of Jul 3, 2022

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Jul 7, 2022

WEB OF SCIENCETM
Citations

4
Last Week
0
Last month
0
Citations as of Jul 7, 2022

Google ScholarTM

Check

Altmetric


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