Work

Novel CP model and CP-assisted meta-heuristic algorithm for flexible job shop scheduling with preventive maintenance

Year: 2025

Type: article

Abstract: The research investigates the flexible job shop scheduling problem with preventive maintenance (FJSP-PM) by considering two maintenance strategies namely fixed preventive maintenance (FJSP-FPM) and periodic preventive maintenance (FJSP-PPM). The objective is minimizing the makespan. We first propose two novel constraint programming (CP) models for FJSP-FPM and FJSP-PPM to obtain optimal solutions. Then, we design a CP-assisted meta-heuristic framework, and develop a CP-assisted Q-learning-based collaborative variable neighborhood search algorithm (CVNSQ-CP) as a representative example to effectively address large-scale instances. Finally, the experimental evaluation on benchmark instances validates the capability of the CP model and CVNSQ-CP. Specifically, compared with existing mathematical models, the proposed CP model proves 3 new optimal solutions and improves 11 current best-known solutions for FJSP-FPM, and it improves 13 current best-known solutions for FJSP-PPM. Meanwhile, CVNSQ-CP outperforms current state-of-the-art methods by improving 9 current best-known solutions for FJSP-FPM and 3 current best-known solutions for FJSP-PPM.

Source: Egyptian Informatics Journal

DOI: 10.1016/j.eij.2025.100759

Authors: Lixin Zhao, Leilei Meng, Weiyao Cheng, Yaping Ren, Biao Zhang, Hongyan Sang

Institutions: Liaocheng University, State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Beijing Institute of Technology

Language: English

Topic: Scheduling and Optimization Algorithms

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $1,200

Funder: National Natural Science Foundation of China