Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/661
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Logistics and Maritime Studies | - |
| dc.creator | Yuan, JJ | - |
| dc.creator | Cheng, TCE | - |
| dc.creator | Ng, CTD | - |
| dc.date.accessioned | 2014-12-11T08:27:31Z | - |
| dc.date.available | 2014-12-11T08:27:31Z | - |
| dc.identifier.issn | 0377-2217 | - |
| dc.identifier.uri | http://hdl.handle.net/10397/661 | - |
| dc.language.iso | en | en_US |
| dc.publisher | Elsevier | en_US |
| dc.rights | European Journal of Operational Research © 2006 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. | en_US |
| dc.subject | Scheduling | en_US |
| dc.subject | Single-variable-resource | en_US |
| dc.subject | Total weighted completion time | en_US |
| dc.subject | NP-hardness | en_US |
| dc.title | NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time | en_US |
| dc.type | Journal/Magazine Article | en_US |
| dc.identifier.spage | 631 | - |
| dc.identifier.epage | 633 | - |
| dc.identifier.volume | 178 | - |
| dc.identifier.issue | 2 | - |
| dc.identifier.doi | 10.1016/j.ejor.2006.02.014 | - |
| dcterms.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. | - |
| dcterms.accessRights | open access | en_US |
| dcterms.bibliographicCitation | European journal of operational research, 16 Apr. 2007, v. 178, no. 2, p. 631-633 | - |
| dcterms.isPartOf | European journal of operational research | - |
| dcterms.issued | 2007-04-16 | - |
| dc.identifier.isi | WOS:000242726800023 | - |
| dc.identifier.scopus | 2-s2.0-33750989641 | - |
| dc.identifier.eissn | 1872-6860 | - |
| dc.identifier.rosgroupid | r30618 | - |
| dc.description.ros | 2006-2007 > Academic research: refereed > Publication in refereed journal | - |
| dc.description.oa | Accepted Manuscript | en_US |
| dc.identifier.FolderNumber | OA_IR/PIRA | en_US |
| dc.description.pubStatus | Published | en_US |
| 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
90
Last Week
0
0
Last month
Citations as of Jul 3, 2022
Downloads
162
Citations as of Jul 3, 2022
SCOPUSTM
Citations
4
Last Week
0
0
Last month
0
0
Citations as of Jul 7, 2022
WEB OF SCIENCETM
Citations
4
Last Week
0
0
Last month
0
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.