Abstract
This paper addresses two-stage flow shop scheduling with parallel machines at one stage. For finding a minimum makespan schedule, which is strongly NP-hard, some efficient heuristics have been proposed in the literature. In this paper we enrich the set of heuristics by introducing a few classes of heuristics, and show that the existing heuristics can be put into this classification scheme. Furthermore, we give a complete theoretical analysis of the worst-case performance of the classes. Some empirical evaluations and comparisons for the average-case performance of a few typical heuristics in the classes are also performed.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, B. Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage. J Oper Res Soc 46, 234–244 (1995). https://doi.org/10.1057/jors.1995.28
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.1995.28