Dataset File
Description
"Random 250 instances selected from each sub set in NetRes, making a total of 1750 instances from all subsets, used on ""On the summary measures for the RCPSP"" (to appear)"
Number of instances
1750
Format
rcp+res
Statistics
Set statistics:
Number of instances: 1750
- Solved (exact proc.): 1725 (98.57%)
- Closed (LB=UB): 1726 (98.63%)
- Open (LB<UB): 24 (1.37%)
Average deviation over CPM:
- Lower bound: 70.22%
- Upper bound: 70.33%
Sum of lower bounds: 203791
Sum of upper bounds: 203847
Open time units: 56 (0.03%)
Avg CPU lower bounds: 38.896s (max 3600.780s)
Avg CPU upper bounds: 0.801s (max 152.060s)
Avg CPU optimal sol.: 3.319s (max 2575.330s)
Reference 2:
- Lower bounds: 353 (20.17%)
Reference 3:
- Upper bounds: 35 (2.00%)
Reference 4:
- Lower bounds: 8 (0.46%)
- Optimal solutions: 367 (20.97%)
Reference 1:
- Lower bounds: 968 (55.31%)
- Upper bounds: 1360 (77.71%)
- Optimal solutions: 1336 (76.34%)
Reference 5:
- Lower bounds: 11 (0.63%)
- Upper bounds: 1 (0.06%)
- Optimal solutions: 6 (0.34%)
Reference 6:
- Lower bounds: 30 (1.71%)
- Upper bounds: 1 (0.06%)
- Optimal solutions: 16 (0.91%)
Number of instances: 1750
- Solved (exact proc.): 1725 (98.57%)
- Closed (LB=UB): 1726 (98.63%)
- Open (LB<UB): 24 (1.37%)
Average deviation over CPM:
- Lower bound: 70.22%
- Upper bound: 70.33%
Sum of lower bounds: 203791
Sum of upper bounds: 203847
Open time units: 56 (0.03%)
Avg CPU lower bounds: 38.896s (max 3600.780s)
Avg CPU upper bounds: 0.801s (max 152.060s)
Avg CPU optimal sol.: 3.319s (max 2575.330s)
Reference 2:
- Lower bounds: 353 (20.17%)
Reference 3:
- Upper bounds: 35 (2.00%)
Reference 4:
- Lower bounds: 8 (0.46%)
- Optimal solutions: 367 (20.97%)
Reference 1:
- Lower bounds: 968 (55.31%)
- Upper bounds: 1360 (77.71%)
- Optimal solutions: 1336 (76.34%)
Reference 5:
- Lower bounds: 11 (0.63%)
- Upper bounds: 1 (0.06%)
- Optimal solutions: 6 (0.34%)
Reference 6:
- Lower bounds: 30 (1.71%)
- Upper bounds: 1 (0.06%)
- Optimal solutions: 16 (0.91%)
RecordSets
Record sets:
ID;1
Author(s); Demeulemeester, E. and Herroelen, W.
Reference; Demeulemeester, E. and Herroelen, W. (1992). A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science, 38:1803-1818.
Date; 1992/01/01
Hardware / software; Stevin Supercomputer Infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria; 1 second(s) and 1 minute
Submission date; 2017/5/26
ID;2
Author(s); Klein, R. and Scholl, A.
Reference;Klein, R. and Scholl, A. (1999). Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research, 112:322?346
Date; 1999/01/01
Hardware / software; i7, 16GB, 2GHz, C++, Visual Studio 2015 (x64), Windows 10
Stop criteria;none
Submission date; 2016/01/01
ID;3
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
ID;4
Author(s); Coelho, Jose and Vanhoucke, Mario
Reference; Coelho, Jose and Vanhoucke, Mario. 2018. 'An exact composite lower bound strategy for the resource - constrained project scheduling problem', Computers & Operations Research 93, 1: 135 - 150. doi: 10.1016/j.cor.2018.01.017
Date; 2018/01/26
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s); 1000 seconds, 0 schedules.
Submission date; 2021/10/22
ID;5
Author(s); Coelho, Jose and Vanhoucke, Mario
Reference; Coelho, Jose and Vanhoucke, Mario. 2018. 'An exact composite lower bound strategy for the resource - constrained project scheduling problem', Computers & Operations Research 93, 1: 135 - 150. doi: 10.1016/j.cor.2018.01.017
Date; 2018/01/26
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s); 60000 seconds, 0 schedules.
Submission date; 2021/10/22
ID;6
Author(s); Coelho, Jose and Vanhoucke, Mario
Reference; Coelho, Jose and Vanhoucke, Mario. 2018. 'An exact composite lower bound strategy for the resource - constrained project scheduling problem', Computers & Operations Research 93, 1: 135 - 150. doi: 10.1016/j.cor.2018.01.017
Date; 2018/01/26
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s); 3600000 seconds, 0 schedules.
Submission date; 2021/10/23
ID;1
Author(s); Demeulemeester, E. and Herroelen, W.
Reference; Demeulemeester, E. and Herroelen, W. (1992). A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science, 38:1803-1818.
Date; 1992/01/01
Hardware / software; Stevin Supercomputer Infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria; 1 second(s) and 1 minute
Submission date; 2017/5/26
ID;2
Author(s); Klein, R. and Scholl, A.
Reference;Klein, R. and Scholl, A. (1999). Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research, 112:322?346
Date; 1999/01/01
Hardware / software; i7, 16GB, 2GHz, C++, Visual Studio 2015 (x64), Windows 10
Stop criteria;none
Submission date; 2016/01/01
ID;3
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
ID;4
Author(s); Coelho, Jose and Vanhoucke, Mario
Reference; Coelho, Jose and Vanhoucke, Mario. 2018. 'An exact composite lower bound strategy for the resource - constrained project scheduling problem', Computers & Operations Research 93, 1: 135 - 150. doi: 10.1016/j.cor.2018.01.017
Date; 2018/01/26
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s); 1000 seconds, 0 schedules.
Submission date; 2021/10/22
ID;5
Author(s); Coelho, Jose and Vanhoucke, Mario
Reference; Coelho, Jose and Vanhoucke, Mario. 2018. 'An exact composite lower bound strategy for the resource - constrained project scheduling problem', Computers & Operations Research 93, 1: 135 - 150. doi: 10.1016/j.cor.2018.01.017
Date; 2018/01/26
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s); 60000 seconds, 0 schedules.
Submission date; 2021/10/22
ID;6
Author(s); Coelho, Jose and Vanhoucke, Mario
Reference; Coelho, Jose and Vanhoucke, Mario. 2018. 'An exact composite lower bound strategy for the resource - constrained project scheduling problem', Computers & Operations Research 93, 1: 135 - 150. doi: 10.1016/j.cor.2018.01.017
Date; 2018/01/26
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s); 3600000 seconds, 0 schedules.
Submission date; 2021/10/23
Best Known Solutions
Original Instances
File Header
Title;Random NetRes
Description;"Random 250 instances selected from each sub set in NetRes, making a total of 1750 instances from all subsets, used on ""On the summary measures for the RCPSP"" (to appear)"
Number;1750
Format;rcp+res
Description;"Random 250 instances selected from each sub set in NetRes, making a total of 1750 instances from all subsets, used on ""On the summary measures for the RCPSP"" (to appear)"
Number;1750
Format;rcp+res
Date