| Article ID: | iaor20127629 |
| Volume: | 33 |
| Issue: | 4 |
| Start Page Number: | 439 |
| End Page Number: | 445 |
| Publication Date: | Oct 1999 |
| Journal: | RAIRO - Operations Research |
| Authors: | Haouari Mohamed, Daouas Thouraya |
| Keywords: | combinatorial optimization, scheduling |
We address the 3‐Machine Assembly‐Type Flowshop Scheduling Problem (3MAF). This problem is known to be NP‐complete in the strong sense. We propose an exact branch and bound method based on a recursive enumeration of potential inputs and outputs of the machines. Using this algorithm, several large size instances have been solved to optimality.