Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times

Rajesh Swaminathan, Michele E. Pfund, John Fowler, Scott J. Mason, Ahmet Keha

Research output: Contribution to journalArticle

18 Scopus citations

Abstract

This paper is motivated by the problem of meeting due dates in a flowshop production environment with jobs with different weights and uncertain processing times. Enforcement of a permutation schedule to varying degrees for dynamic flowshops is investigated with the goal of minimizing total weighted tardiness (TWT). The approaches studied are categorized as follows: (1) pure permutation scheduling (2) shift-based scheduling (3) pure dispatching (which leads to non-permutation sequences). A simulation-based experimental study was carried out to study the performance of the above methods with respect to minimizing TWT when new jobs arrive to the flowshop at every shift change. Results indicate significant gains in performance are possible when the permutation requirement is relaxed and shift-based scheduling is allowed. Shift-based scheduling yields competitive results with respect to the pure dispatching approach, even though dispatching has the advantage of a full relaxation of the permutation requirement.

Original languageEnglish (US)
Pages (from-to)3055-3068
Number of pages14
JournalComputers and Operations Research
Volume34
Issue number10
DOIs
StatePublished - Oct 1 2007

Keywords

  • Flowshop
  • Heuristic
  • Manufacturing
  • Permutation

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times'. Together they form a unique fingerprint.

  • Cite this