Research on Distributed Flow Shop Scheduling Technology
This paper explores the distributed flow shop scheduling problem within the realm of production scheduling and proposes an optimisation algorithm. We first establish a multi - objective mixed - integer programming model, aiming to minimise the makespan and equipment idle time. Then, by integrating the ant colony algorithm with a multi - objective optimisation algorithm, we design a novel ant colony - MODE algorithm to address the problem. Finally, we validate the effectiveness of the ACO - MODE algorithm through case studies. Overall, this research offers valuable theoretical insights and practical benefits for enhancing the production scheduling and efficiency of distributed flow shops.
Authors
- Yan Ge (ORCID: https://orcid.org/0009-0005-5618-6099)
- Hui Tang
- Wei Lin (ORCID: https://orcid.org/0000-0003-3880-5026)
- Niansong Zhang (ORCID: https://orcid.org/0000-0002-2850-0176)
- Z. Jiao (ORCID: https://orcid.org/0009-0009-6288-7042)
- Aimin Wang (ORCID: https://orcid.org/0000-0002-7259-8297)
Institutions
- Beijing Institute of Technology (CN)
- Nanjing University of Science and Technology (CN)
- Nanjing University of Posts and Telecommunications (CN)
- Henan Academy of Sciences (CN)
- Beijing Jingshida Electromechanical Equipment Research Institute (CN)
Publication Details
- Published
- 2025-08-03
- DOI
- https://doi.org/10.1109/icma65362.2025.11120795
- Primary Topic
- Scheduling and Optimization Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00