Author(s):Araujo, J. A. S., Santos, H. G., Gendron, B., Jena, S. D., Brito, S. S., & Souza, D. S.
Reference:Araujo, J. A. S., Santos, H. G., Gendron, B., Jena, S. D., Brito, S. S., & Souza, D. S. (2020). Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes. Computers & Operations Research, 113, 104782. https://doi.org/10.1016/j.cor.2019.104782
Date:2020
Hardware / software:All computational experiments have been carried out on a computing cluster (Compute Canada) composed by Intel Xeon X5650 Westmere processors with 2,67 GHz and 512 GB of RAM running Scientific Linux release 6.3. All algorithms were coded in ANSI C 99 and compiled with GCC version 5.4.0, with flags -Ofast and solver GUROBI version 8.0.1 (Gurobi Optimization, 2016).
Stop criteria:86000 seconds
Submission date:2021
Instances: 78
Optimal results: 21 (26.92%)
Upper Bounds: 21
- Average deviations:
- over CPM: 0.00%
- over best LB: 0.00%
- over best UB: 0.00%
- Best Known: 21 (26.92%)
- Closed (using best LBs): 21 (26.92%)
- Sum of time units: 1600
Lower Bounds: 78
- Average deviations:
- over CPM: -42.47%
- below best LB: 53.32%
- below best UB: 54.17%
- Best Known: 21 (26.92%)
- Closed (using best UBs): 21 (26.92%)
- Sum of time units: 3223
- Open time units:
- to LBs: 4141 (56.23%)
- to UBs: 4375 (57.58%)