Overload-Checking and Edge-Finding for Robust Cumulative Scheduling

DOI10.1287/IJOC.2021.0138OpenAlexW4384161751MaRDI QIDQ6200119FDOQ6200119

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

uncertaintydata structureconstraint programmingconstraint propagationfiltering algorithmsrobust cumulative scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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)