Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times

Muberra Allahverdi*, Ali Allahverdi, Bertrand M.T. Lin

*Corresponding author for this work

Research output: Contribution to journalArticle

Abstract

We address a two-machine no-wait flowshop scheduling problem with respect to the performance measure of total completion time. Minimizing total completion time is important when inventory cost is of concern. Setup times are treated separately from processing times. Furthermore, setup times are uncertain with unknown distributions and are within some lower and upper bounds. We develop a dominance relation and propose eight algorithms to solve the problem. The proposed algorithms, which assign different weights to the processing and setup times on both machines, convert the two-machine problem into a single-machine one for which an optimal solution is known. We conduct computational experiments to evaluate the proposed algorithms. Computational experiments reveal that one of the proposed algorithms, which assigns the same weight to setup and processing times, is superior to the rest of the algorithms. The results are statistically verified by constructing confidence intervals and test of hypothesis.

Original languageEnglish
Pages (from-to)2439-2457
Number of pages19
JournalJournal of Industrial and Management Optimization
Volume16
Issue number5
DOIs
StatePublished - Sep 2020

Keywords

  • No-wait owshop
  • Scheduling
  • Total completion time
  • Uncerain setup times

Fingerprint Dive into the research topics of 'Minimizing total completion time in a two-machine no-wait flowshop with uncertain and bounded setup times'. Together they form a unique fingerprint.

  • Cite this