Please use this identifier to cite or link to this item:
|Title:||Asymptotically optimal schedules for single-server flow shop problems with setup costs and times|
Flexible machine scheduling
|Citation:||Iravani, S.M.R., Teo, C.P. (2005). Asymptotically optimal schedules for single-server flow shop problems with setup costs and times. Operations Research Letters 33 (4) : 421-430. ScholarBank@NUS Repository. https://doi.org/10.1016/j.orl.2004.08.007|
|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. © 2004 Published by Elsevier B.V.|
|Source Title:||Operations Research Letters|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 11, 2018
WEB OF SCIENCETM
checked on Oct 17, 2018
checked on Nov 3, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.