Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem

Open Webpage

Carla Juvin, Laurent Houssin, Pierre Lopez

Published: 2023, Last Modified: 11 Dec 2025Comput. Oper. Res. 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•The preemptive flexible job-shop scheduling problem is studied.•We focus on exact methods to minimise the makespan.•An original logic-based Benders decomposition scheme is proposed.•Computational experiments show the very good performance of our method.