Options
2-STAGE FLOWSHOP SCHEDULING PROBLEM WITH BICRITERIA
Date Issued
1992
Author(s)
RAJENDRAN, C
Abstract
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.
Volume
43