Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.orl.2004.08.007
Title: Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
Authors: Iravani, S.M.R.
Teo, C.P. 
Keywords: Asymptotic optimality
Flexible machine scheduling
Flow shop
Setup times
Issue Date: 2005
Source: 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
URI: http://scholarbank.nus.edu.sg/handle/10635/44116
ISSN: 01676377
DOI: 10.1016/j.orl.2004.08.007
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

10
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

8
checked on Nov 19, 2017

Page view(s)

56
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.