Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan

Abstract The existing algorithms for optimizing the flowshop scheduling problem with the objective of minimizing makespan assume that every stage has a single processor. This paper relaxes this assumption and presents a branch-and-bound algorithms for scheduling in the flowshop with parallel processors. The computational experience on the working of the algorithm is also reported.