Article ID: | iaor2006792 |
Country: | United Kingdom |
Volume: | 32 |
Issue: | 7 |
Start Page Number: | 1831 |
End Page Number: | 1847 |
Publication Date: | Jul 2005 |
Journal: | Computers and Operations Research |
Authors: | Haouari Mohamed, Ladhari Talel |
Keywords: | programming: branch and bound |
We consider the classical permutation flow shop problem which requires scheduling