PolyU IR
 

PolyU Institutional Repository >
Logistics and Maritime Studies >
LMS Journal/Magazine Articles >

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, J. J.
Cheng, T. C. Edwin
Ng, Chi-to Daniel
Subjects: Scheduling
Single-variable-resource
Total weighted completion time
NP-hardness
Issue Date: 16-Apr-2007
Publisher: Elsevier B.V.
Citation: European journal of operational research, 16 Apr. 2007, v. 178, no. 2, p. 631-633.
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.
Description: 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.
Type: Journal/Magazine Article
URI: http://hdl.handle.net/10397/661
ISSN: 03772217
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:

File Description SizeFormat
NP_HARD(Conjecture)_Final.pdfPre-published version106.95 kBAdobe PDFView/Open
Locate publisher version via PolyU eLinks



Facebook Facebook del.icio.us del.icio.us LinkedIn LinkedIn


All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.

 

© Pao Yue-kong Library, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Powered by DSpace (Version 1.5.2)  © MIT and HP
Feedback | Privacy Policy Statement | Copyright & Restrictions - Feedback