Dataset File
Description
Dataset proposed in the paper Vanhoucke, M., Coelho, J., and Batselier, J. (2016). An overview of project data for integrated project management and control. Journal of Modern Project Management, 3(2):621.
Number of instances
720
Format
rcp
Statistics
Set statistics:
Number of instances: 720
- Solved (exact proc.): 562 (78.06%)
- Closed (LB=UB): 580 (80.56%)
- Open (LB<UB): 140 (19.44%)
Average deviation over CPM:
- Lower bound: 270.74%
- Upper bound: 273.87%
Sum of lower bounds: 130058
Sum of upper bounds: 130990
Open time units: 932 (0.72%)
Avg CPU lower bounds: 2253.491s (max 21601.990s)
Avg CPU upper bounds: 121.166s (max 21600.000s)
Avg CPU optimal sol.: 159.205s (max 13970.990s)
Reference 1:
- Lower bounds: 404 (56.11%)
- Upper bounds: 352 (48.89%)
- Optimal solutions: 443 (61.53%)
Reference 7:
- Lower bounds: 91 (12.64%)
- Upper bounds: 38 (5.28%)
- Optimal solutions: 87 (12.08%)
Reference 3:
- Upper bounds: 194 (26.94%)
Reference 4:
- Lower bounds: 106 (14.72%)
- Upper bounds: 2 (0.28%)
- Optimal solutions: 32 (4.44%)
Reference 2:
- Lower bounds: 36 (5.00%)
Reference 5:
- Upper bounds: 10 (1.39%)
Reference 6:
- Upper bounds: 10 (1.39%)
Reference 8:
- Upper bounds: 11 (1.53%)
Number of instances: 720
- Solved (exact proc.): 562 (78.06%)
- Closed (LB=UB): 580 (80.56%)
- Open (LB<UB): 140 (19.44%)
Average deviation over CPM:
- Lower bound: 270.74%
- Upper bound: 273.87%
Sum of lower bounds: 130058
Sum of upper bounds: 130990
Open time units: 932 (0.72%)
Avg CPU lower bounds: 2253.491s (max 21601.990s)
Avg CPU upper bounds: 121.166s (max 21600.000s)
Avg CPU optimal sol.: 159.205s (max 13970.990s)
Reference 1:
- Lower bounds: 404 (56.11%)
- Upper bounds: 352 (48.89%)
- Optimal solutions: 443 (61.53%)
Reference 7:
- Lower bounds: 91 (12.64%)
- Upper bounds: 38 (5.28%)
- Optimal solutions: 87 (12.08%)
Reference 3:
- Upper bounds: 194 (26.94%)
Reference 4:
- Lower bounds: 106 (14.72%)
- Upper bounds: 2 (0.28%)
- Optimal solutions: 32 (4.44%)
Reference 2:
- Lower bounds: 36 (5.00%)
Reference 5:
- Upper bounds: 10 (1.39%)
Reference 6:
- Upper bounds: 10 (1.39%)
Reference 8:
- Upper bounds: 11 (1.53%)
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; 3600 second(s)
Submission date; 2017/5/20
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: 100 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); 21600000 seconds, 0 schedules.
Submission date; 2019/11/15
ID;5
Author(s);Mario Vanhoucke and Jos Coelho
Reference;Vanhoucke, M., & Coelho, J. (2024). Reducing the feasible solution space of resource-constrained project instances. Computers & Operations Research, 165, 106567. https://doi.org/10.1016/j.cor.2024.106567
Date;01/05/2024
"Hardware / software ";Stevin Supercomputer Infrastructure, C++, compiler intel / 2017.02, Linux
Stop criteria(s); 500000 schedules
Submission date; 2024/01/01
ID;6
Author(s);Vanhoucke, M. and Coelho, J.
Reference;Vanhoucke, M., & Coelho, J. (2024). A matheuristic for the resource-constrained project scheduling problem. European Journal of Operational Research, 319(3), 711725. https://doi.org/10.1016/j.ejor.2024.07.016
Date;01/12/2024
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s);Best results from all runs
Submission date; 2024/04/08
ID;7
Author(s); Coelho, Jose and Vanhoucke, Mario
Reference; Coelho, Jose and Vanhoucke, Mario. 2024. Working paper 'Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem'
Date; 2024/10/20
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s);Several procedures and stop criteria, the last one with 20 hours.
Submission date; 2024/10/20
ID;8
Author(s);Vanhoucke, M. and Coelho, J.
Reference;https://www.projectmanagement.ugent.be/research/data
Date; 2024/01/01
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s);Best found value of the GA, SS, EM procedure with 500,000 schedules using 100 runs. This value can be considered as the best UB that can be found with these procedures. These are the values reported in the RCPLIB file.
Submission date; 2024/01/01
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; 3600 second(s)
Submission date; 2017/5/20
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: 100 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); 21600000 seconds, 0 schedules.
Submission date; 2019/11/15
ID;5
Author(s);Mario Vanhoucke and Jos Coelho
Reference;Vanhoucke, M., & Coelho, J. (2024). Reducing the feasible solution space of resource-constrained project instances. Computers & Operations Research, 165, 106567. https://doi.org/10.1016/j.cor.2024.106567
Date;01/05/2024
"Hardware / software ";Stevin Supercomputer Infrastructure, C++, compiler intel / 2017.02, Linux
Stop criteria(s); 500000 schedules
Submission date; 2024/01/01
ID;6
Author(s);Vanhoucke, M. and Coelho, J.
Reference;Vanhoucke, M., & Coelho, J. (2024). A matheuristic for the resource-constrained project scheduling problem. European Journal of Operational Research, 319(3), 711725. https://doi.org/10.1016/j.ejor.2024.07.016
Date;01/12/2024
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s);Best results from all runs
Submission date; 2024/04/08
ID;7
Author(s); Coelho, Jose and Vanhoucke, Mario
Reference; Coelho, Jose and Vanhoucke, Mario. 2024. Working paper 'Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem'
Date; 2024/10/20
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s);Several procedures and stop criteria, the last one with 20 hours.
Submission date; 2024/10/20
ID;8
Author(s);Vanhoucke, M. and Coelho, J.
Reference;https://www.projectmanagement.ugent.be/research/data
Date; 2024/01/01
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s);Best found value of the GA, SS, EM procedure with 500,000 schedules using 100 runs. This value can be considered as the best UB that can be found with these procedures. These are the values reported in the RCPLIB file.
Submission date; 2024/01/01
Best Known Solutions
Original Instances
File Header
Title;DC2
Description;Dataset proposed in the paper Vanhoucke, M., Coelho, J., and Batselier, J. (2016). An overview of project data for integrated project management and control. Journal of Modern Project Management, 3(2):621.
Number;720
Format;rcp
Description;Dataset proposed in the paper Vanhoucke, M., Coelho, J., and Batselier, J. (2016). An overview of project data for integrated project management and control. Journal of Modern Project Management, 3(2):621.
Number;720
Format;rcp
Date