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

S. M.R. Iravani*, C. P. Teo

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

14 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 2005

Funding

We would like to thank the Associate Editor and an anonymous referee for their extensive comments that have helped to substantially improve the presentation of this paper. The work of the first author was supported by the National Science Foundation under grant DMI-0099803.

Keywords

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

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

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