| Article ID: | iaor20032804 |
| Country: | Netherlands |
| Volume: | 31 |
| Issue: | 4 |
| Start Page Number: | 319 |
| End Page Number: | 322 |
| Publication Date: | Jul 2003 |
| Journal: | Operations Research Letters |
| Authors: | Cheng T.C. Edwin, Liu Zhaohui |
| Keywords: | heuristics |
We consider in this paper the two-machine no-wait flowshop scheduling problem in which each machine may have an unavailable interval. We present a polynomial time approximation scheme for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap.