Schedules for a two-stage hybrid flowshop with parallel machines at the second stage

Abstract

Approximate solution algorithms are developed to find a minimum makespan schedule in a two-stage hybrid flowshop when the second stage consists of multiple identical machines. Computational experience comparing the ‘approximate’ makespans with their respective global lower bounds for large problems indicates that proposed polynomially bounded approximate algorithms are quite effective. It is shown that the proposed heuristic algorithms can be used to improve the efficiency of an existing branch and bound algorithm.