A concise survey of scheduling with time-dependent processing times

Edwin Tai Chiu Cheng, Q. Ding, B. M.T. Lin

Research output: Journal article publicationReview articleAcademic researchpeer-review

541 Citations (Scopus)

Abstract

We consider a class of machine scheduling problems in which the processing time of a task is dependent on its starting time in a schedule. On reviewing the literature on this topic, we provide a framework to illustrate how models for this class of problems have been generalized from the classical scheduling theory. A complexity boundary is presented for each model and related existing results are consolidated. We also introduce some enumerative solution algorithms and heuristics and analyze their performance. Finally, we suggest a few interesting areas for future research.
Original languageEnglish
Pages (from-to)1-13
Number of pages13
JournalEuropean Journal of Operational Research
Volume152
Issue number1
DOIs
Publication statusPublished - 1 Jan 2004

Keywords

  • Computational complexity
  • Scheduling
  • Sequencing
  • Survey
  • Time dependence

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this