Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/661
Title: NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
Authors: Yuan, JJ
Cheng, TCE 
Ng, CTD 
Keywords: Scheduling
Single-variable-resource
Total weighted completion time
NP-hardness
Issue Date: 16-Apr-2007
Publisher: Elsevier B.V.
Source: European journal of operational research, 16 Apr. 2007, v. 178, no. 2, p. 631-633 How to cite?
Journal: European journal of operational research 
Abstract: Baker 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.
URI: http://hdl.handle.net/10397/661
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.02.014
Rights: European Journal of Operational Research © 2006 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
NP_HARD(Conjecture)_Final.pdfPre-published version106.95 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
Citations as of Feb 7, 2016

WEB OF SCIENCETM
Citations

2
Citations as of Feb 6, 2016

Page view(s)

366
Checked on Feb 7, 2016

Google ScholarTM
Citations

loading...

Altmetric



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