Scheduling with processing set restrictions: A survey

Joseph Y T Leung, Chung Lun Li

Research output: Journal article publicationJournal articleAcademic researchpeer-review

113 Citations (Scopus)

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
Pages (from-to)251-262
Number of pages12
JournalInternational Journal of Production Economics
Volume116
Issue number2
DOIs
Publication statusPublished - 1 Dec 2008

Keywords

  • Computational complexity
  • Parallel machines
  • Processing set restrictions
  • Scheduling
  • Worst-case analysis

ASJC Scopus subject areas

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

Cite this