Abstract
Scheduling problems with processing set restrictions have been studied extensively by computer scientists and operations researchers under different names. These include "scheduling typed task systems," "multi-purpose machine scheduling," "scheduling with eligibility constraints," "scheduling with processing set restrictions," and "semi-matchings for bipartite graphs." In this paper we survey the state of the art of these problems. Our survey covers offline and online problems, as well as nonpreemptive and preemptive scheduling environments. Our emphasis is on polynomial-time algorithms, complexity issues, and approximation schemes. While our main focus is on the makespan objective, other performance criteria are also discussed. © 2008 Elsevier B.V. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 251-262 |
| Journal | International Journal of Production Economics |
| Volume | 116 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Dec 2008 |
| 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
- Computational complexity
- Parallel machines
- Processing set restrictions
- Scheduling
- Worst-case analysis
Fingerprint
Dive into the research topics of 'Scheduling with processing set restrictions: A survey'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver