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 Citations (Scopus)

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 2007

Fingerprint

Tardiness
Flow Shop
Dispatching
scheduling
Permutation
Scheduling
Processing
Due Dates
Requirements
performance
Experimental Study
Schedule
simulation
time
Flow shop
Enforcement
Simulation

Keywords

  • Flowshop
  • Heuristic
  • Manufacturing
  • Permutation

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Applied Mathematics
  • Modeling and Simulation
  • Transportation

Cite this

Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times. / Swaminathan, Rajesh; Pfund, Michele E.; Fowler, John; Mason, Scott J.; Keha, Ahmet.

In: Computers and Operations Research, Vol. 34, No. 10, 10.2007, p. 3055-3068.

Research output: Contribution to journalArticle

Swaminathan, Rajesh ; Pfund, Michele E. ; Fowler, John ; Mason, Scott J. ; Keha, Ahmet. / Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times. In: Computers and Operations Research. 2007 ; Vol. 34, No. 10. pp. 3055-3068.
@article{9f9853689bd74f9b804c93a807ca7038,
title = "Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times",
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.",
keywords = "Flowshop, Heuristic, Manufacturing, Permutation",
author = "Rajesh Swaminathan and Pfund, {Michele E.} and John Fowler and Mason, {Scott J.} and Ahmet Keha",
year = "2007",
month = "10",
doi = "10.1016/j.cor.2005.11.014",
language = "English (US)",
volume = "34",
pages = "3055--3068",
journal = "Surveys in Operations Research and Management Science",
issn = "0305-0548",
publisher = "Elsevier Limited",
number = "10",

}

TY - JOUR

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

AU - Swaminathan, Rajesh

AU - Pfund, Michele E.

AU - Fowler, John

AU - Mason, Scott J.

AU - Keha, Ahmet

PY - 2007/10

Y1 - 2007/10

N2 - 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.

AB - 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.

KW - Flowshop

KW - Heuristic

KW - Manufacturing

KW - Permutation

UR - http://www.scopus.com/inward/record.url?scp=33847619266&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33847619266&partnerID=8YFLogxK

U2 - 10.1016/j.cor.2005.11.014

DO - 10.1016/j.cor.2005.11.014

M3 - Article

AN - SCOPUS:33847619266

VL - 34

SP - 3055

EP - 3068

JO - Surveys in Operations Research and Management Science

JF - Surveys in Operations Research and Management Science

SN - 0305-0548

IS - 10

ER -