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: 9256
Upper Bounds: 9256
- Average deviations:
- over CPM: 81.60%
- over best LB: 7.54%
- over best UB: 0.13%
- Best Known: 8475 (91.56%)
- Closed (using best LBs): 4808 (51.94%)
- Sum of time units: 557294
- Open time units:
- to LBs: 35889 (6.88%)
- to UBs: 863 (0.16%)
Instances: 9256
Upper Bounds: 9256
- Average deviations:
- over CPM: 81.60%
- over best LB: 7.54%
- over best UB: 0.13%
- Best Known: 8475 (91.56%)
- Closed (using best LBs): 4808 (51.94%)
- Sum of time units: 557294
- Open time units:
- to LBs: 35889 (6.88%)
- to UBs: 863 (0.16%)
Date