Rajendran, Chandrasekharan Two-stage flowshop scheduling problem with bicriteria. (English) Zbl 0757.90037 J. Oper. Res. Soc. 43, No. 9, 871-884 (1992). Summary: The two-state 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. Cited in 24 Documents MSC: 90B35 Deterministic scheduling theory in operations research 90-08 Computational methods for problems pertaining to operations research and mathematical programming Keywords:two-state flowshop scheduling; optimal makespan; branch-and-bound; heuristic PDFBibTeX XMLCite \textit{C. Rajendran}, J. Oper. Res. Soc. 43, No. 9, 871--884 (1992; Zbl 0757.90037) Full Text: DOI