A unified solution framework for flexible job shop scheduling problems with multiple resource constraints
Abstract: Highlights•A thorough literature review on shop scheduling problems with resource constraints.•A novel CP-based Adaptive Large Neighbourhood Search (ALNS-CP) is proposed.•The ALNS-CP solves efficiently a wide variety of shop scheduling problems.•A comprehensive study of the effect of resource constraints on the makespan.•39 new best solutions are reported on well-known benchmarks of the literature.
External IDs:dblp:journals/eor/KasapidisPMR25
Loading