Results File
Dataset
File Header
Author(s): Debels, D. and Vanhoucke, M.
Reference:Debels, D., & Vanhoucke, M. (2007). A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem. Operations Research, 55(3), 457-469. https://doi.org/10.1287/opre.1060.0358
Date: 2007/01/01
Hardware / software: Stevin Supercomputer Infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria:cumulated results from several runs, on open instances only. Maximal run: 10 runs x 500k schedules
Submission date: 2017/5/21
Statistics
Nothing changed since there are no new lower bounds, upper bounds nor optimal solutions.
Instances: 56
Upper Bounds: 56
- Average deviations:
- over CPM: 80.50%
- over best LB: 0.08%
- over best UB: 0.08%
- Best Known: 53 (94.64%)
- Closed (using best LBs): 53 (94.64%)
- Sum of time units: 3378
- Open time units:
- to LBs: 3 (0.09%)
- to UBs: 3 (0.09%)
Instances: 56
Upper Bounds: 56
- Average deviations:
- over CPM: 80.50%
- over best LB: 0.08%
- over best UB: 0.08%
- Best Known: 53 (94.64%)
- Closed (using best LBs): 53 (94.64%)
- Sum of time units: 3378
- Open time units:
- to LBs: 3 (0.09%)
- to UBs: 3 (0.09%)
Date