Jaya Algorithm for Rescheduling Flexible Job Shop Problem with Machine Recovery
- Resource Type
- Conference
- Authors
- Gao, K.Z.; Zhou, M.C.; Pan, Y.X.
- Source
- 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC) Systems, Man and Cybernetics (SMC), 2019 IEEE International Conference on. :3660-3664 Oct, 2019
- Subject
- Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
General Topics for Engineers
Power, Energy and Industry Applications
Robotics and Control Systems
Signal Processing and Analysis
Transportation
Job shop scheduling
Sociology
Statistics
Electric breakdown
Schedules
Optimization
Modeling
- Language
- ISSN
- 2577-1655
This work addresses on flexible job shop rescheduling problem with machine recovery. The goal is to minimize the maximum machine workload and instability simultaneously. As an almost parameter-free metaheuristic, Jaya is used and developed to solve it. A local search operator and an initializing rule are developed for improving Jaya’s performance. Ten cases from a remanufacturing company are solved to verify the proposed Jaya’s performance. The comparisons and discussions show the effectiveness of the proposed Jaya for rescheduling flexible job shop with machine recovery.