We address the 3-Machine Assembly-Type Flowshop Scheduling
Problem (3MAF). This problem is known to be NP-complete in the strong
We propose an exact branch and bound method based on a recursive
of potential inputs and outputs of the machines. Using this algorithm,
large size instances have been solved to optimality.