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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Knowledge-based systems Ročník 258; s. 109962
Hlavní autoři: Qin, Haoxiang, Han, Yuyan, Wang, Yuting, Liu, Yiping, Li, Junqing, Pan, Quanke
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 22.12.2022
Témata:
Blocking
Hybrid flow shop group scheduling problem
Iterated greedy algorithm
Makespan
Neighborhood probabilistic selection strategies
Blocking
Iterated greedy algorithm
Makespan
Hybrid flow shop group scheduling problem
Neighborhood probabilistic selection strategies
ISSN:0950-7051, 1872-7409
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:0950-7051
1872-7409
DOI:10.1016/j.knosys.2022.109962