Overload-Checking and Edge-Finding for Robust Cumulative Scheduling
Published Online:13 Jul 2023https://doi.org/10.1287/ijoc.2021.0138
Volume 35, Issue 6
November-December 2023
Pages 1215-1532, C2
Article Information
Supplemental Material
Metrics
Information
- Received:May 28, 2021
- Accepted:May 08, 2023
- Published Online:July 13, 2023
Copyright © 2023, INFORMS
Cite as
Hamed Fahimi, Claude-Guy Quimper (2023) Overload-Checking and Edge-Finding for Robust Cumulative Scheduling. INFORMS Journal on Computing 35(6):1419-1438.
https://doi.org/10.1287/ijoc.2021.0138
Keywords
The authors thank Alban Derrien for his implementation of the time-tabling algorithm (Derrien et al. 2014). Moreover, we would like to express our special gratitude to Shahid Chamran University of Ahvaz for supporting this project with grant number SCU.MC1402.44132.
