| Article ID: | iaor20122531 |
| Volume: | 6 |
| Issue: | 3 |
| Start Page Number: | 559 |
| End Page Number: | 569 |
| Publication Date: | Mar 2012 |
| Journal: | Optimization Letters |
| Authors: | Hadda Hatem |
| Keywords: | scheduling, combinatorial optimization |
In this paper, we develop a polynomial‐time approximation scheme for the two‐machine flow shop scheduling problem with several availability constraints on the first machine, under the resumable scenario.