Fragment-Free Constraint Programming for the Preemptive Flexible Job Shop Scheduling Problem
Vincent Boyer, M. Angélica Salazar-Aguilar
Abstract
This article addresses the preemptive flexible job shop scheduling problem with makespan minimization (FJm | pmtn | Cmax). We propose an exact constraint programming approach that completely avoids representing the processing fragments of an operation. Operations are placed in flexible time windows, where Horn's workload condition guarantees feasible preemptive scheduling, and Jackson's preemptive earliest-deadline-first rule reconstructs exact processing segments post-optimization in O(n log n) time per machine. To manage undecided machine assignments, we extend the PreemptiveNoOverlap global constraint to optional intervals within IBM ILOG CP Optimizer, performing overload checking and preemptive edge-finding in O(n log n) time while eliminating infeasible machine alternatives. The CP model is warm-started using a multi-round MILP assignment relaxation with Carlier's head-tail bounds and a window-based greedy heuristic. Extensive computational experiments on 276 pFJSSP benchmark instances and 78 pJSSP instances demonstrate that the proposed method significantly advances the state of the art. Within a 600~s time limit, it improves the upper bounds of the previously published logic-based Benders decomposition by 3.6% on average, increases the number of proven optimal pFJSSP instances from 102 to 180, and closes 74 instances for the first time (including the entire Barnes family). On the pJSSP under identical hardware conditions, it proves 67 of 78 instances optimal (compared to 51 by the baseline solver Mistral) and closes 9 of the 11 long-standing open problems.
Create a lesson
Related papers
Optimal Scheduling of Multi-Site AI Data Centers in Day-Ahead Markets
Xinyang Zhou, Guido Cavraro
Minimization of free energy in a Poisson--Boltzmann problem
Shahid Ali, Klemen Bohinc, Angeles Martinez et al.
Lyapunov Theory for Output-to-State Stability of Nonlinear Infinite-Dimensional Systems
Qiaoling Chen, Andrii Mironchenko, Fabian Wirth
Semi-global Convergence and Finite-Sample Error Bounds for Model Predictive Path Integral Control
Christian Fiedler, Giacomo Borghi
When Suspicion Adds Up: A Stochastic Framework for Optimizing Honeypot-Based Insider-Threat Detection
Saharnaz Mehrani, Lujia Zhan, Mohsen Emadikhiav et al.
Hamiltonian Potential Optimization for Partially Observed Stochastic Optimal Control
Christian Bayer, Saifeddine Ben Naamia, Erik von Schwerin et al.