Efficient Algorithms for The Multi-Stage Flexible Flow Shop Scheduling Problem with Transportation and Unloading Times

Authors

  • Lotfi Hidri Department of Industrial Engineering, College of Engineering, King Saud University, Riyadh, Saudi Arabia
  • Mehdi Tlija Department of Industrial Engineering, College of Engineering, King Saud University, Riyadh, Saudi Arabia

DOI:

https://doi.org/10.23055/ijietap.2024.31.4.9701

Abstract

Improving efficiency in multi-stage flexible flowshop operations is essential for modern industrial systems. Optimizing total completion time while simultaneously considering the unloading and transportation times is vital for enhanced productivity and cost-effectiveness. This study delves into the intricate realm of flexible flow shop scheduling, particularly focusing on scenarios prevalent in modern manufacturing processes such as sand casting. Despite limited exploration in prior literature for particular cases, the significance of this problem underscores the pressing need for efficient algorithms and the exploration of new problem properties. Notably, we unveil the symmetry inherent in the problem, where scheduling from the initial stage to the final one, or vice versa, yields identical optimal solutions, thereby augmenting solution quality. Given the strongly NP-Hard nature of the problem, approximate solutions are preferred, especially for medium to large-scale instances. To address this challenge, we propose a novel two-phase heuristic approach, encompassing both a constructive phase and an improvement phase. Leveraging an existing efficient heuristic tailored for parallel machine scheduling, our method extends to efficiently incorporate considerations for unloading and transportation times. The efficacy of the two-phase heuristic lies in its ability to consistently generate high-quality schedules at each stage. Furthermore, we introduce efficient lower bounds derived from estimating the minimum idle time within each stage, drawing from insights in polynomial parallel machine scheduling with a focus on flow time minimization in preceding stages. These lower bounds serve as critical benchmarks for evaluating the performance of the two-phase heuristic against the relative gap performance measure. Extensive experimentation on benchmark test problems underscores the effectiveness of our proposed algorithms, with results demonstrating an average computation time of 9.48 seconds and a mean relative gap of only 2.42% across varying job and stage quantities up to 200 jobs and 10 stages.

Published

2024-08-15

How to Cite

Hidri, L., & Tlija, M. (2024). Efficient Algorithms for The Multi-Stage Flexible Flow Shop Scheduling Problem with Transportation and Unloading Times. International Journal of Industrial Engineering: Theory, Applications and Practice, 31(4). https://doi.org/10.23055/ijietap.2024.31.4.9701

Issue

Section

Operations Research