Article ID: | iaor2008186 |
Country: | United Kingdom |
Volume: | 7 |
Issue: | 5 |
Start Page Number: | 333 |
End Page Number: | 348 |
Publication Date: | Sep 2004 |
Journal: | Journal of Scheduling |
Authors: | Lenstra Jan Karel, Hoogeveen Han, Yu Wenci |
Keywords: | computational analysis |
One of the first problems to be studied in scheduling theory was the problem of minimizing the makespan in a two-machine flow shop. Johnson showed that this problem can be solved in