| Article ID: | iaor1993113 |
| Country: | Netherlands |
| Volume: | 27 |
| Issue: | 2 |
| Start Page Number: | 137 |
| End Page Number: | 143 |
| Publication Date: | May 1992 |
| Journal: | International Journal of Production Economics |
| Authors: | Chaudhuri Dipak, Rajendran Chandrasekharan |
| Keywords: | programming: branch and bound |
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 algorithm for scheduling in the flowshop with parallel processors. The computational experience on the working of the algorithm is also reported.