Dynamic Scheduling Study of Flexible Job Shop Considering Machine Failure Rate

DOI

10.2991/978-2-38476-126-5_6How to use a DOI?

Keywords

flexible job shop; production disturbance; rescheduling; MOABC

Abstract

For the flexible job shop dynamic scheduling problem, set machine priorities based on machine failure rates, a scheduling model with the objective of minimizing the maximum completion time and machine load balance ratio is established, and an improved ABC algorithm is designed to solve it. An external solution set is introduced in the iterative optimization stage of the algorithm to realize the solution of the ABC algorithm for multiple objectives. The effectiveness of the optimal scheduling algorithm is verified by the classical flexible job shop scheduling problem.

Copyright

© 2023 The Author(s)

Open Access

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 4.0 International License (http://creativecommons.org/licenses/by-nc/4.0/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

Download article (PDF)

TY  - CONF
AU  - Wenmin Han
AU  - Zhuoya Feng
AU  - Jiahui Cai
PY  - 2023
DA  - 2023/10/31
TI  - Dynamic Scheduling Study of Flexible Job Shop Considering Machine Failure Rate
BT  - Proceedings of the 2023 7th International Seminar on Education, Management and Social Sciences (ISEMSS 2023)
PB  - Atlantis Press
SP  - 42
EP  - 47
SN  - 2352-5398
UR  - https://doi.org/10.2991/978-2-38476-126-5_6
DO  - 10.2991/978-2-38476-126-5_6
ID  - Han2023
ER  -