title: Efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times.
abstract: 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. The heuristic 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.
authors.affiliation: Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia.
authors.forename: Lotfi
authors.identifier: 0000-0002-8279-2827
authors.initials: L
authors.lastname: Hidri
authors.affiliation: Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia.
authors.forename: Anis
authors.identifier: 0000-0001-5658-7259
authors.initials: A
authors.lastname: Gharbi
authors.affiliation: Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia.
authors.forename: Mohamed Aly
authors.identifier: 0000-0002-9134-7629
authors.initials: MA
authors.lastname: Louly
mesh_terms: D066192:Manufacturing Industry / Q000458:organization & administration*; D008962:Models, Theoretical