Asymptotically optimal schedules for single-server flow shop problems with setup costs and times

Seyed MR Iravani*, C. P. Teo

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

We consider the processing of M jobs in a flow shop with N stations in which only a single server is in charge of all stations. We demonstrate that for the objective of minimizing the total setup and holding cost, a class of easily implementable schedules is asymptotically optimal.

Original languageEnglish (US)
Pages (from-to)421-430
Number of pages10
JournalOperations Research Letters
Volume33
Issue number4
DOIs
StatePublished - Jul 1 2005

Keywords

  • Asymptotic optimality
  • Flexible machine scheduling
  • Flow shop
  • Setup times

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Discrete Mathematics and Combinatorics
  • Modeling and Simulation

Fingerprint Dive into the research topics of 'Asymptotically optimal schedules for single-server flow shop problems with setup costs and times'. Together they form a unique fingerprint.

Cite this