Sequencing three-stage flexible flowshops with identical machines to minimize makespan

We study the problem of sequencing n jobs on a three-stage flowshop with multiple identical machines at each stage (a flexible flowshop). The objective is to minimize the makespan. Since the problem is strongly NP-complete. we develop and compare several heuristic procedures of time complexity 0(nlogn). We were successful in deriving the worst case performance bound of one procedure. We have also developed several lower bounds that serve as datum for comparison; the lower bound used in the evaluation is always the best among them. Extensive experiments were conducted to evaluate the performance of the proposed procedures, and preferences are concluded based on their average performance.