✦ LIBER ✦

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

✍ Scribed by S.M.R. Iravani; C.P. Teo

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 221 KB
Volume: 33
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2004.08.007

No coin nor oath required. For personal study only.

✦ Synopsis

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.