Overload-Checking and Edge-Finding for Robust Cumulative Scheduling

DOI10.1287/IJOC.2021.0138MaRDI QIDQ6200119zbMATH OpenOpenAlexFDO

Authors Hamed Fahimi, Claude-Guy Quimper

Publication date 22 March 2024

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.2021.0138

zbMATH Keywords

constraint programmingconstraint propagationdata structurefiltering algorithmsrobust cumulative schedulinguncertainty

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A quadratic edge-finding filtering algorithm for cumulative resource constraints
• Timetable edge finding filtering algorithm for discrete cumulative resources
• Edge finding for cumulative scheduling
• Max Energy Filtering Algorithm for Discrete Cumulative Resources
• Time-table disjunctive reasoning for the cumulative constraint

This page was built for publication: Overload-Checking and Edge-Finding for Robust Cumulative Scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200119)