Dataset File
Description
Set intended to study serial/parallel morphology indicator influence. It is equilibrated on other morphologic indicators, and on resource indicators, and it have enough instances to allow obtain solid conclusions. It is built on MT Set2 networks and on ResSet1 resources set. See paper: Vanhoucke, Mario, Coelho, Jose. 2018. A tool to test and validate algorithms for the resource-constrained project scheduling problem, Computers & Industrial Engineering 118, 1: 251 - 265.
Number of instances
540000
Format
rcp+res
Statistics
Set statistics:
Number of instances: 540000
- Solved (exact proc.): 414382 (76.74%)
- Closed (LB=UB): 514409 (95.26%)
- Open (LB<UB): 25591 (4.74%)
Average deviation over CPM:
- Lower bound: 77.66%
- Upper bound: 78.76%
Sum of lower bounds: 63151192
Sum of upper bounds: 63286370
Open time units: 135178 (0.21%)
Avg CPU lower bounds: 0.222s (max 60.280s)
Avg CPU upper bounds: 1.011s (max 64.200s)
Avg CPU optimal sol.: 0.222s (max 60.280s)
Reference 1:
- Lower bounds: 302562 (56.03%)
- Upper bounds: 429124 (79.47%)
- Optimal solutions: 414382 (76.74%)
Reference 2:
- Lower bounds: 115674 (21.42%)
Reference 3:
- Upper bounds: 16383 (3.03%)
Number of instances: 540000
- Solved (exact proc.): 414382 (76.74%)
- Closed (LB=UB): 514409 (95.26%)
- Open (LB<UB): 25591 (4.74%)
Average deviation over CPM:
- Lower bound: 77.66%
- Upper bound: 78.76%
Sum of lower bounds: 63151192
Sum of upper bounds: 63286370
Open time units: 135178 (0.21%)
Avg CPU lower bounds: 0.222s (max 60.280s)
Avg CPU upper bounds: 1.011s (max 64.200s)
Avg CPU optimal sol.: 0.222s (max 60.280s)
Reference 1:
- Lower bounds: 302562 (56.03%)
- Upper bounds: 429124 (79.47%)
- Optimal solutions: 414382 (76.74%)
Reference 2:
- Lower bounds: 115674 (21.42%)
Reference 3:
- Upper bounds: 16383 (3.03%)
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/25
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;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/25
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
Best Known Solutions
Original Instances
File Header
Title;Morphology SP indicator
Description;Set intended to study serial/parallel morphology indicator influence. It is equilibrated on other morphologic indicators, and on resource indicators, and it have enough instances to allow obtain solid conclusions. It is built on MT Set2 networks and on ResSet1 resources set. See paper: Vanhoucke, Mario, Coelho, Jose. 2018. A tool to test and validate algorithms for the resource-constrained project scheduling problem, Computers & Industrial Engineering 118, 1: 251 - 265.
Number;540000
Format;rcp+res
Description;Set intended to study serial/parallel morphology indicator influence. It is equilibrated on other morphologic indicators, and on resource indicators, and it have enough instances to allow obtain solid conclusions. It is built on MT Set2 networks and on ResSet1 resources set. See paper: Vanhoucke, Mario, Coelho, Jose. 2018. A tool to test and validate algorithms for the resource-constrained project scheduling problem, Computers & Industrial Engineering 118, 1: 251 - 265.
Number;540000
Format;rcp+res
Date