We study the scheduling of N jobs in a V-stage hybrid flow shop with identical parallel machines, when jobs are subject to precedence constraints, several time lags, and due-dates. Precedence constraints concern jobs: they enable the modeling of several uses of the same sequence of machines or different processing units in a flow shop organization. Time lags can be either machine setup time, machine removal time or transportation time. Six new heuristics are presented to solve this problem minimizing maximum lateness. Numerous experiments have been done to assess the performance and robustness of these algorithms. Computational results illustrate the solution quality.
