Results File
Dataset
File Header
Author(s): Debels, D. and Vanhoucke, M.
Reference: Debels, D. and Vanhoucke, M. (2007). A decomposition-based genetic algorithm for the resource-constrained project scheduling problems. Operations Research, 55:457-469.
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: 26
Upper Bounds: 26
- Average deviations:
- over CPM: 68.57%
- over best LB: 5.10%
- over best UB: 0.19%
- Best Known: 23 (88.46%)
- Closed (using best LBs): 15 (57.69%)
- Sum of time units: 1534
- Open time units:
- to LBs: 62 (4.21%)
- to UBs: 3 (0.20%)
Instances: 26
Upper Bounds: 26
- Average deviations:
- over CPM: 68.57%
- over best LB: 5.10%
- over best UB: 0.19%
- Best Known: 23 (88.46%)
- Closed (using best LBs): 15 (57.69%)
- Sum of time units: 1534
- Open time units:
- to LBs: 62 (4.21%)
- to UBs: 3 (0.20%)
Date