Exact SAT and Constraint Programming for Job Shop Scheduling with Time-Varying Peak Power Constraints
This paper develops the first exact SAT and constraint programming (CP) formulations for the JSPPR, and provides corrected optimal makespans and a complete set of certified optimal results for the JSPPR benchmark, establishing a reliable reference for future studies.