An effective heuristic for adaptive control of job sequences subject to variation in processing times

Wei Li, Theodor I. Freiheit

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

Variation in sequential task processing times is common in manufacturing systems. This type of disturbance challenges most scheduling methods since they cannot fundamentally change job sequences to adaptively control production performance as jobs enter the system because actual processing times, are not known in advance. Some research literature indicates that simple rules are more suitable than algorithmic scheduling methods for adaptive control. In this work, a state space - average processing time (SS-APT) heuristic is proposed and compared to four most commonly used scheduling rules and two well-established heuristics based on Taillards benchmarks. It is shown that the adaptive control is made possible under variation in processing times given the flexibility and strong performance of the SS-APT heuristic, especially for work-in-process inventory control.

Original languageEnglish
Pages (from-to)3491-3507
Number of pages17
JournalInternational Journal of Production Research
Volume54
Issue number12
DOIs
StatePublished - Jun 17 2016

Bibliographical note

Publisher Copyright:
© 2015 Informa UK Limited, trading as Taylor & Francis Group.

Keywords

  • adaptive control
  • flow shop
  • scheduling
  • variation in processing times

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'An effective heuristic for adaptive control of job sequences subject to variation in processing times'. Together they form a unique fingerprint.

Cite this