Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/1838
| Title: | Scheduling unit-length jobs with machine eligibility restrictions | Authors: | Li, CL | Issue Date: | 16-Oct-2006 | Source: | European journal of operational research, 16 Oct. 2006, v. 174, no. 2, p. 1325-1328 | Abstract: | We consider uniform parallel machine scheduling problems with unit-length jobs where every job is only allowed to be processed on a specified subset of machines. We develop efficient methods to solve problems with various objectives, including minimizing a total tardiness function, a maximum tardiness function, total completion time, the number of tardy jobs, the makespan, etc. | Keywords: | Scheduling Machine eligibility restrictions Unit-length jobs Uniform machines |
Publisher: | Elsevier | Journal: | European journal of operational research | ISSN: | 0377-2217 | EISSN: | 1872-6860 | DOI: | 10.1016/j.ejor.2005.03.023 | Rights: | European Journal of Operational Research © 2005 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 | |
|---|---|---|---|---|
| 48 Final-Version.pdf | Pre-published version | 85.13 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
143
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
219
Citations as of Apr 21, 2024
SCOPUSTM
Citations
30
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
23
Last Week
0
0
Last month
0
0
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.