Flexible job shop scheduling with stochastic machine breakdowns by an improved tuna swarm optimization algorithm

In job-shop production environments, machine breakdowns are a significant factor in reducing productivity. Existing approaches seldom consider algorithm improvement and rescheduling scheme design in an integrated manner, and lack stability considerations. This paper addresses the flexible job shop s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of manufacturing systems Ročník 74; s. 180 - 197
Hlavní autoři: Fan, Chengshuai, Wang, Wentao, Tian, Jun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.06.2024
Témata:
Flexible job-shop scheduling
Machine breakdowns
Rescheduling
Tuna swarm optimization algorithm
Flexible job-shop scheduling
Tuna swarm optimization algorithm
Machine breakdowns
Rescheduling
ISSN:0278-6125, 1878-6642
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í:In job-shop production environments, machine breakdowns are a significant factor in reducing productivity. Existing approaches seldom consider algorithm improvement and rescheduling scheme design in an integrated manner, and lack stability considerations. This paper addresses the flexible job shop scheduling problem with random machine breakdowns, aiming to produce a stable rescheduling scheme that minimizes a combined index of maximum completion time and stability. The paper innovatively applies the tuna swarm optimization algorithm to the flexible job shop scheduling problem, proposing an efficient and superior improved version called the genetic chaos levy nonlinear tuna swarm optimization (GCLNTSO) algorithm. Three stability metrics are designed to guide the generation of efficient and stable rescheduling schemes. A rescheduling scheme is proposed that combines right-shift rescheduling with complete rescheduling. The proposed scheme is benchmarked against Brandymalter and Kacem’s problems, and compared with other algorithms from the literature. The results demonstrate that the GCLNTSO algorithm outperforms other algorithms in terms of both performance and stability. •An improved TSO algorithm (GCLNTSO) is designed.•A hybrid rescheduling strategy and three stability indicators are designed.•Numerical experiments have demonstrated that the GCLNTSO is effective.
ISSN:0278-6125
1878-6642
DOI:10.1016/j.jmsy.2024.03.002