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