Related Experiment Video
Updated: Apr 13, 2026

Operation of the Collaborative Composite Manufacturing CCM System
Published on: October 1, 2019
Efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times
Lotfi Hidri1, Anis Gharbi1, Mohamed Aly Louly1
1Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia.
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.
Related Concept Videos
The Power Flow Problem and Solution
Fast Decoupled and DC Powerflow
Turbulent Flow: Problem Solving
Temperature is a key factor in CO2 solubility. In this case, the CO2 gas and the liquid are cooled to 20°C. Lower temperatures...
Uniform Depth Channel Flow: Problem Solving
Optimization Problems
Gaussian Elimination: Problem Solving

