Efficient Bounding Schemes for the Two-Center Hybrid Flow Shop Scheduling Problem with Removal Times

Abstract EN

We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times.

The job removal time is the required duration to remove it from a machine after its processing.

The objective is to minimize the maximum completion time (makespan).

A heuristic and a lower bound are proposed for this NP-Hard problem.

These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times.

Theheuristic is composed of two phases.

The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one.

Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.