| Article ID: | iaor20073267 |
| Country: | United Kingdom |
| Volume: | 34 |
| Issue: | 1 |
| Start Page Number: | 152 |
| End Page Number: | 162 |
| Publication Date: | Jan 2007 |
| Journal: | Computers and Operations Research |
| Authors: | Cheng T.C. Edwin, Wang Xiuli |
| Keywords: | heuristics |
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 ⅔.