Intelligent optimization under blocking constraints: A novel iterated greedy algorithm for the hybrid flow shop group scheduling problem

This paper introduces a new flow shop combinatorial optimization problem, called the blocking hybrid flow shop group scheduling problem (BHFGSP). In the problem, no buffers exist between any adjacent machines, and a set of jobs with different sequence-dependent setup times needs to be scheduled and processed at organized manufacturing cells. We verify the correctness of the mathematical model of BHFGSP by using CPLEX. In this paper, we proposed a novel iterated greedy algorithm to solve the problem. The proposed algorithm has two key techniques. One is the decoding procedure that calculates the makespan of a job sequence, and the other is the neighborhood probabilistic selection strategies with families and blocking-based jobs. The performance of the proposed algorithm is investigated through a large number of numerical experiments. Comprehensive results show that the proposed algorithm is effective in solving BHFGSP. (c) 2022 Elsevier B.V. All rights reserved.

Automated summary

This paper introduces a new flow shop combinatorial optimization problem, called the blocking hybrid flow shop group scheduling problem (BHFGSP). The proposed algorithm, a novel iterated greedy algorithm, is effective in solving the BHFGSP. Experimental results demonstrate the algorithm's performance.