Robust scheduling on a single machine using time buffers

Dirk Briskorn, Joseph Leung, Michael Pinedo

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

This article studies the scheduling of buffer times in a single-machine environment. A buffer time is a machine idle time in between two consecutive jobs and is a common tool to protect a schedule against disruptions such as machine failures. This article introduces new classes of robust machine scheduling problems. For an arbitrary non-preemptive scheduling problem 1|β|γ, three corresponding robustness problems are obtained: (i) maximize overall (weighted) buffer time while ensuring a given schedule's performance (with regard to the objective function γ); (ii) optimize the schedule's performance (with regard to γ) while ensuring a given minimum overall (weighted) buffer time; and (iii) find the trade-off curve regarding both objectives. The relationships between the different classes of problems and the corresponding underlying problems are outlined. Furthermore, the robust counterparts of three very basic single-machine scheduling problems are analyzed.

Original languageEnglish (US)
Pages (from-to)383-398
Number of pages16
JournalIIE Transactions (Institute of Industrial Engineers)
Volume43
Issue number6
DOIs
StatePublished - Jun 2011

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Keywords

  • Single-machine scheduling
  • buffer time allocation
  • robustness

Fingerprint Dive into the research topics of 'Robust scheduling on a single machine using time buffers'. Together they form a unique fingerprint.

Cite this