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. © 2005 Elsevier B.V. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 1325-1328 |
| Journal | European Journal of Operational Research |
| Volume | 174 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 16 Oct 2006 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Machine eligibility restrictions
- Scheduling
- Uniform machines
- Unit-length jobs
Fingerprint
Dive into the research topics of 'Scheduling unit-length jobs with machine eligibility restrictions'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver