A survey of scheduling with controllable processing times

Dvir Shabtay, George Steiner

Research output: Contribution to journalArticlepeer-review

310 Scopus citations

Abstract

In classical deterministic scheduling problems, the job processing times are assumed to be constant parameters. In many practical cases, however, processing times are controllable by allocating a resource (that may be continuous or discrete) to the job operations. In such cases, each processing time is a decision variable to be determined by the scheduler, who can take advantage of this flexibility to improve system performance. Since scheduling problems with controllable processing times are very interesting both from the practical and theoretical point of view, they have received a lot of attention from researchers over the last 25 years. This paper aims to give a unified framework for scheduling with controllable processing times by providing an up-to-date survey of the results in the field.

Original languageEnglish
Pages (from-to)1643-1666
Number of pages24
JournalDiscrete Applied Mathematics
Volume155
Issue number13
DOIs
StatePublished - 15 Aug 2007
Externally publishedYes

Keywords

  • Complexity
  • Controllable processing times
  • Deterministic scheduling
  • Resource allocation

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A survey of scheduling with controllable processing times'. Together they form a unique fingerprint.

Cite this