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
New results:
20 new upper bounds
14 previous closed instances analysed
1 new closed instances
19 open instances updates (upper and lower bounds)
Results saved in sites/default/files/datasets/1kNetResAD.csv
BKS saved in sites/default/files/datasets/1kNetResAD_BKS.csv
Instances: 56
Upper Bounds: 56
- Average deviations:
- over CPM: 80.50%
- over best LB: 10.05%
- over best UB: 0.08%
- Best Known: 53 (94.64%)
- Closed (using best LBs): 12 (21.43%)
- Sum of time units: 3378
- Open time units:
- to LBs: 283 (9.14%)
- to UBs: 3 (0.09%)
20 new upper bounds
14 previous closed instances analysed
1 new closed instances
19 open instances updates (upper and lower bounds)
Results saved in sites/default/files/datasets/1kNetResAD.csv
BKS saved in sites/default/files/datasets/1kNetResAD_BKS.csv
Instances: 56
Upper Bounds: 56
- Average deviations:
- over CPM: 80.50%
- over best LB: 10.05%
- over best UB: 0.08%
- Best Known: 53 (94.64%)
- Closed (using best LBs): 12 (21.43%)
- Sum of time units: 3378
- Open time units:
- to LBs: 283 (9.14%)
- to UBs: 3 (0.09%)
Date