Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1834
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Logistics and Maritime Studies | - |
dc.creator | Li, CL | - |
dc.creator | Wang, X | - |
dc.date.accessioned | 2014-12-11T08:25:30Z | - |
dc.date.available | 2014-12-11T08:25:30Z | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | http://hdl.handle.net/10397/1834 | - |
dc.language.iso | en | en_US |
dc.publisher | Elsevier | en_US |
dc.rights | European Journal of Operational Research © 2009 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com. | en_US |
dc.subject | Scheduling | en_US |
dc.subject | Parallel machines | en_US |
dc.subject | Release times | en_US |
dc.subject | Worst-case analysis | en_US |
dc.subject | Polynomial time approximation scheme | en_US |
dc.title | Scheduling parallel machines with inclusive processing set restrictions and job release times | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 702 | - |
dc.identifier.epage | 710 | - |
dc.identifier.volume | 200 | - |
dc.identifier.issue | 3 | - |
dc.identifier.doi | 10.1016/j.ejor.2009.02.011 | - |
dcterms.abstract | We consider the problem of scheduling a set of jobs with different release times on parallel machines so as to minimize the makespan of the schedule. The machines have the same processing speed, but each job is compatible with only a subset of those machines. The machines can be linearly ordered such that a higher-indexed machine can process all those jobs that a lower-indexed machine can process. We present an efficient algorithm for this problem with a worst-case performance ratio of 2. We also develop a polynomial time approximation scheme (PTAS) for the problem, as well as a fully polynomial time approximation scheme (FPTAS) for the case in which the number of machines is fixed. | - |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | European journal of operational research, 1 Feb. 2010, v. 200, no. 3, p. 702-710 | - |
dcterms.isPartOf | European journal of operational research | - |
dcterms.issued | 2010-02-01 | - |
dc.identifier.isi | WOS:000270701200008 | - |
dc.identifier.scopus | 2-s2.0-69749107598 | - |
dc.identifier.eissn | 1872-6860 | - |
dc.identifier.rosgroupid | r48886 | - |
dc.description.ros | 2009-2010 > 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 | |
---|---|---|---|---|
63 Final-Version.pdf | Pre-published version | 219.15 kB | Adobe PDF | View/Open |
Page views
136
Last Week
0
0
Last month
Citations as of Mar 24, 2024
Downloads
306
Citations as of Mar 24, 2024
SCOPUSTM
Citations
29
Last Week
0
0
Last month
0
0
Citations as of Mar 28, 2024
WEB OF SCIENCETM
Citations
26
Last Week
0
0
Last month
0
0
Citations as of Mar 28, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.