Abstract
This paper studies the two-machine flowshop scheduling problem with anticipatory setup times and an availability constraint imposed on only one of the machines where interrupted jobs can resume their operations. We present two heuristics and show that their worst-case error bounds are no larger than frac(2, 3).
Original language | English |
---|---|
Pages (from-to) | 152-162 |
Number of pages | 11 |
Journal | Computers and Operations Research |
Volume | 34 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jan 2007 |
Keywords
- Error bound
- Flowshop scheduling
- Heuristics
ASJC Scopus subject areas
- Information Systems and Management
- Management Science and Operations Research
- Applied Mathematics
- Modelling and Simulation
- Transportation