Scheduling with processing set restrictions: A survey

Joseph Y.T. Leung, Chung Lun Li

Research output: Contribution to journalArticlepeer-review

114 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)251-262
Number of pages12
JournalInternational Journal of Production Economics
Volume116
Issue number2
DOIs
StatePublished - Dec 2008

All Science Journal Classification (ASJC) codes

  • Business, Management and Accounting(all)
  • Economics and Econometrics
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

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