Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage

► We study the hybrid flow shop problem with precedence relations. ► An adaptive randomized list scheduling heuristic is proposed. ► Two global lower bounds are examined. ► Distance to the optimum, in average, is under 5% for randomly generated instances.