| Article ID: | iaor19931777 |
| Country: | United Kingdom |
| Volume: | 43 |
| Issue: | 9 |
| Start Page Number: | 871 |
| End Page Number: | 884 |
| Publication Date: | Sep 1992 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Rajendran C. |
| Keywords: | programming: branch and bound |
The two-stage flowshop scheduling problem with the objective of minimizing total flowtime subject to obtaining the optimal makespan is discussed. A branch-and-bound algorithm and two heuristic algorithms have been developed. The results of the experimental investigation of the effectiveness of the algorithms are also presented.