| Article ID: | iaor20106955 |
| Volume: | 8 |
| Issue: | 3 |
| Start Page Number: | 271 |
| End Page Number: | 280 |
| Publication Date: | Oct 2010 |
| Journal: | 4OR |
| Authors: | Hadda Hatem |
| Keywords: | flowshop |
In this paper we deal with the two-machine flow shop scheduling problem with several availability constraints on the first machine, under the resumable scenario. We first develop an improved algorithm with a relative worst-case error bound of 4/3. We then present a polynomially solvable case.