Article ID Journal Published Year Pages File Type
10524223 Operations Research Letters 2005 10 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
Authors
, ,