Affordable Access

Publisher Website

Scheduling with processing set restrictions: A survey

Authors
Journal
International Journal of Production Economics
0925-5273
Publisher
Elsevier
Publication Date
Volume
116
Issue
2
Identifiers
DOI: 10.1016/j.ijpe.2008.09.003
Keywords
  • Scheduling
  • Parallel Machines
  • Processing Set Restrictions
  • Computational Complexity
  • Worst-Case Analysis
Disciplines
  • Computer Science

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.