Single-objective flexible job-shop scheduling problem based on improved dung beetle optimization

Single-objective flexible job-shop scheduling problem based on improved dung beetle optimization

Given the characteristics of the flexible job-shop scheduling problem and the practical production of a given enterprise, a flexible job-shop scheduling model was proposed to minimize the maximum completion time. A novel algorithm was proposed to solve the model by integrating the dung beetle optimi...

Full description

Bibliographic Details
Main Authors: Shuangji Yao, Yunfei Guo, Botao Yang, You Lv, Marco Ceccarelli, Xiaoshuang Dai, Giuseppe Carbone
Format: Article
Language:English
Published: AIMS Press 2024-07-01
Series:STEM Education
Subjects:
flexible job-shop scheduling problems
maximum completion time
dung beetle optimizer
simulated annealing
single layer encoding
Online Access:https://www.aimspress.com/article/doi/10.3934/steme.2024018?viewType=HTML

Internet

https://www.aimspress.com/article/doi/10.3934/steme.2024018?viewType=HTML

Similar Items