Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1145
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Cheng, TCE | - |
dc.creator | Liu, Z | - |
dc.date.accessioned | 2014-12-11T08:22:58Z | - |
dc.date.available | 2014-12-11T08:22:58Z | - |
dc.identifier.issn | 0740-817X | - |
dc.identifier.uri | http://hdl.handle.net/10397/1145 | - |
dc.language.iso | en | en_US |
dc.publisher | Taylor & Francis | en_US |
dc.rights | Copyright © “IIE”. | en_US |
dc.rights | This is an electronic version of an article published in T.C.E. Cheng and Z. Liu (2004), IIE Transactions, 36(1), 11–17. IIE Transactions is available online at: http://www.informaworld.com, the open URL of the article: http://www.informaworld.com/openurl?genre=article&issn=0740-817x&volume=36&&issue=1&spage=11. | en_US |
dc.subject | Parallel machine scheduling | en_US |
dc.subject | Quadratic completion time | en_US |
dc.subject | Probabilistic analysis | en_US |
dc.title | Parallel machine scheduling to minimize the sum of quadratic completion times | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 11 | - |
dc.identifier.epage | 17 | - |
dc.identifier.volume | 36 | - |
dc.identifier.issue | 1 | - |
dc.identifier.doi | 10.1080/07408170490257844 | - |
dcterms.abstract | We consider the parallel machine scheduling problem of minimizing the sum of quadratic job completion times. We first prove that the problem is strongly NP-hard. We then demonstrate by probabilistic analysis that the shortest processing time rule solves the problem asymptotically. The relative error of the rule converges in probability to zero under the assumption that the job processing times are independent random variables uniformly distributed in (0, 1). We finally provide some computational results, which show that the rule is effective in solving the problem in practice. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | IIE transactions, Jan. 2004, v. 36, no. 1, p. 11-17 | - |
dcterms.isPartOf | IIE transactions | - |
dcterms.issued | 2004-01 | - |
dc.identifier.isi | WOS:000220824200002 | - |
dc.identifier.scopus | 2-s2.0-0347268994 | - |
dc.identifier.eissn | 1545-8830 | - |
dc.identifier.rosgroupid | r20342 | - |
dc.description.ros | 2003-2004 > 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 | |
---|---|---|---|---|
QCT_final_version.pdf | Pre-published version | 131.89 kB | Adobe PDF | View/Open |
Page views
408
Last Week
1
1
Last month
Citations as of Apr 14, 2024
Downloads
195
Citations as of Apr 14, 2024
SCOPUSTM
Citations
22
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
19
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.