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 |
Issue Date: | 16-Apr-2007 | Source: | 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. | Keywords: | Scheduling Single-variable-resource Total weighted completion time NP-hardness |
Publisher: | Elsevier | Journal: | European journal of operational research | ISSN: | 0377-2217 | EISSN: | 1872-6860 | 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 | Size | Format | |
|---|---|---|---|---|
| NP_HARD(Conjecture)_Final.pdf | Pre-published version | 106.95 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
103
Last Week
1
1
Last month
Citations as of Jun 4, 2023
Downloads
182
Citations as of Jun 4, 2023
SCOPUSTM
Citations
4
Last Week
0
0
Last month
0
0
Citations as of Jun 8, 2023
WEB OF SCIENCETM
Citations
4
Last Week
0
0
Last month
0
0
Citations as of Jun 8, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.