A review of exact solution methods for the non-preemptive multiprocessor flowshop problem

In this paper we provide the first comprehensive and uniform overview on exact solution methods for flexible flowshops with branching, bounding and propagation of constraints under two different objective functions: minimizing the makespan of a schedule and the mean flow time.