Stochastic proportionate flowshop scheduling with setups

Allahverdi A., Savsar M.

Computers and Industrial Engineering, vol.39, no.3-4, pp.357-369, 2001 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 39 Issue: 3-4
  • Publication Date: 2001
  • Doi Number: 10.1016/s0360-8352(01)00011-0
  • Journal Name: Computers and Industrial Engineering
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.357-369
  • Keywords: Breakdowns, Flowshop, Makespan, Setup times
  • Gazi University Affiliated: No


This paper addresses the problem of scheduling n jobs on a proportionate two-machine flowshop where the machines are subject to random breakdowns and setup times are considered separate from processing times. The considered performance measure is makespan. Sequences that minimize makespan with probability 1 are obtained when the first or the second machine is subject to random breakdowns without making any assumptions about downtime distributions or counting processes. It is assumed that the processing and setup times on one machine dominate the corresponding times on the other machine. In the case that processing and setup times on the first and second machines are proportionate, it is shown that the longest processing time (LPT) rule gives an optimal solution when only the first machine is subject to breakdowns, while the shortest processing time (SPT) rule yields an optimal solution when only the second machine suffers breakdowns. © 2001 Elsevier Science Ltd.