Redundant cumulative constraints to compute preemptive bounds

DOI10.1016/j.dam.2017.05.001zbMath1382.90030OpenAlexW2642675087MaRDI QIDQ1686060

Philippe Baptiste, Nicolas Bonifas

Publication date: 20 December 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.05.001

zbMATH Keywords

reformulationconstraint-based schedulingcumulative constraintpreemptive bound

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Uses Software

• PSPLIB
• CHIP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explaining the \texttt{cumulative} propagator
• Jackson's pseudo-preemptive schedule and cumulative scheduling problems
• Computing redundant resources for the resource constrained project scheduling problem
• Lower bounds and reduction procedures for the bin packing problem
• PSPLIB -- a project scheduling problem library
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• A linear programming and constraint propagation-based lower bound for the RCPSP
• Two-dimensional packing problems: a survey
• Tight LP bounds for resource constrained project scheduling
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• Scheduling with Deadlines and Loss Functions
• Edge Finding for Cumulative Scheduling
• Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources
• Propagation = Lazy Clause Generation