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

S. M.R. Iravani; C. P. Teo

doi:10.1016/j.orl.2004.08.007

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

Industrial Engineering and Management Sciences

Research output: Contribution to journal › Article › peer-review

13 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 language	English (US)
Pages (from-to)	421-430
Number of pages	10
Journal	Operations Research Letters
Volume	33
Issue number	4
DOIs	https://doi.org/10.1016/j.orl.2004.08.007
State	Published - Jul 2005

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

Access to Document

10.1016/j.orl.2004.08.007

Cite this

@article{154eedfb15b44eb9b743dce433d2943d,

title = "Asymptotically optimal schedules for single-server flow shop problems with setup costs and times",

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.",

keywords = "Asymptotic optimality, Flexible machine scheduling, Flow shop, Setup times",

author = "Iravani, {S. M.R.} and Teo, {C. P.}",

note = "Funding Information: 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.",

year = "2005",

month = jul,

doi = "10.1016/j.orl.2004.08.007",

language = "English (US)",

volume = "33",

pages = "421--430",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

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

AU - Iravani, S. M.R.

AU - Teo, C. P.

N1 - Funding Information: 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.

PY - 2005/7

Y1 - 2005/7

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

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

KW - Asymptotic optimality

KW - Flexible machine scheduling

KW - Flow shop

KW - Setup times

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

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

U2 - 10.1016/j.orl.2004.08.007

DO - 10.1016/j.orl.2004.08.007

M3 - Article

AN - SCOPUS:14844314792

VL - 33

SP - 421

EP - 430

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 4

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this