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: 1000 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: 73
Upper Bounds: 73
- Average deviations:
- over CPM: 48.73%
- over best LB: 1.34%
- over best UB: 0.09%
- Best Known: 66 (90.41%)
- Closed (using best LBs): 51 (69.86%)
- Sum of time units: 7581
- Open time units:
- to LBs: 98 (1.31%)
- to UBs: 7 (0.09%)
Instances: 73
Upper Bounds: 73
- Average deviations:
- over CPM: 48.73%
- over best LB: 1.34%
- over best UB: 0.09%
- Best Known: 66 (90.41%)
- Closed (using best LBs): 51 (69.86%)
- Sum of time units: 7581
- Open time units:
- to LBs: 98 (1.31%)
- to UBs: 7 (0.09%)
Date