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).
- Error bound
- Flowshop scheduling
ASJC Scopus subject areas
- Information Systems and Management
- Management Science and Operations Research
- Applied Mathematics
- Modelling and Simulation