Dataset File
Description
Dataset proposed in the paper Kolisch, R. and A. Sprecher (1996): PSPLIB - A project scheduling library, European Journal of Operational Research, Vol. 96,pp. 205--216.
Number of instances
480
Format
sm
Statistics
Set statistics:
Number of instances: 480
- Solved (exact proc.): 461 (96.04%)
- Closed (LB=UB): 462 (96.25%)
- Open (LB<UB): 18 (3.75%)
Average deviation over CPM:
- Lower bound: 10.09%
- Upper bound: 10.37%
Sum of lower bounds: 38215
Sum of upper bounds: 38306
Open time units: 91 (0.24%)
Avg CPU lower bounds: 3300.938s (max 357147.000s)
Avg CPU upper bounds: 234.588s (max 68232.880s)
Avg CPU optimal sol.: 3203.495s (max 357147.000s)
Reference 1:
- Lower bounds: 84 (17.50%)
- Upper bounds: 389 (81.04%)
- Optimal solutions: 377 (78.54%)
Reference 2:
- Lower bounds: 2 (0.42%)
Reference 6:
- Lower bounds: 34 (7.08%)
- Upper bounds: 21 (4.38%)
- Optimal solutions: 26 (5.42%)
Reference 7:
- Lower bounds: 33 (6.88%)
- Upper bounds: 3 (0.62%)
- Optimal solutions: 33 (6.88%)
Reference 3:
- Upper bounds: 63 (13.12%)
Reference 4:
- Lower bounds: 22 (4.58%)
- Optimal solutions: 21 (4.38%)
Reference 5:
- Lower bounds: 2 (0.42%)
Reference 8:
- Lower bounds: 6 (1.25%)
- Upper bounds: 4 (0.83%)
- Optimal solutions: 4 (0.83%)
Number of instances: 480
- Solved (exact proc.): 461 (96.04%)
- Closed (LB=UB): 462 (96.25%)
- Open (LB<UB): 18 (3.75%)
Average deviation over CPM:
- Lower bound: 10.09%
- Upper bound: 10.37%
Sum of lower bounds: 38215
Sum of upper bounds: 38306
Open time units: 91 (0.24%)
Avg CPU lower bounds: 3300.938s (max 357147.000s)
Avg CPU upper bounds: 234.588s (max 68232.880s)
Avg CPU optimal sol.: 3203.495s (max 357147.000s)
Reference 1:
- Lower bounds: 84 (17.50%)
- Upper bounds: 389 (81.04%)
- Optimal solutions: 377 (78.54%)
Reference 2:
- Lower bounds: 2 (0.42%)
Reference 6:
- Lower bounds: 34 (7.08%)
- Upper bounds: 21 (4.38%)
- Optimal solutions: 26 (5.42%)
Reference 7:
- Lower bounds: 33 (6.88%)
- Upper bounds: 3 (0.62%)
- Optimal solutions: 33 (6.88%)
Reference 3:
- Upper bounds: 63 (13.12%)
Reference 4:
- Lower bounds: 22 (4.58%)
- Optimal solutions: 21 (4.38%)
Reference 5:
- Lower bounds: 2 (0.42%)
Reference 8:
- Lower bounds: 6 (1.25%)
- Upper bounds: 4 (0.83%)
- Optimal solutions: 4 (0.83%)
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:18031818.
Date; 1992/01/01
Hardware / software; i7, 16GB, 2GHz, C++, Visual Studio 2015 (x64), Windows 10
Stop criteria;1m and 1h runs
Submission date; 2016/01/01
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: 1000 runs x 500k schedules
Submission date; 2017/5/21
ID;4
Author(s);Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.
Reference;"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G. (2011) ""Explaining the cumulative propagator"". Constraints 16: 250. https://doi.org/10.1007/s10601-010-9103-2"
Date; 2011/07/01
Hardware / software;X86-64 architecture running GNU/Linux and a Intel(R) Xeon(R) CPU E54052 processor with 2 GHz. Code in Mercury using the G12 Constraint Programming Platform
Stop criteria(s);10 min, results reported in the paper as new results at the time of publication
Submission date; 2019/10/28
ID;5
Author(s);Petr Vil?m
Reference;Vil?m, P. (2011). Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources. International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems, 16. https://doi.org/10.1007/978-3-642-21311-3_22
Date;2011
Hardware / software;Intel(R) Core(TM)2 Duo CPU T9400 on 2.53GHz
Stop criteria;time limit for each improvement step is 60 seconds
Submission date;2021
ID;6
Author(s); Coelho, J. and Vanhoucke, M.
Reference;"Coelho, Jose, 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; 2017/06/01
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s);Best results from all runs, with maximal run time of 1h
Submission date; 2017/12/30
ID;7
Author(s);Creemers, Stefan
Reference;Creemers Stefan, 2021, The resource-constrained project scheduling problem: New benchmark results, 17th International Workshop on Project Management and Scheduling (PMS 2021), Toulouse (France), April 21-23, 2021.
Date; 2022/09/05
Hardware / software;Coded in C++, compiled in Visual Studio 2019 (64 bit), and run on a single thread of an Intel I5-4590K CPU running at 3.3GHz with 32GB of RAM using Windows 7.
Stop criteria(s);memory shortage.
Submission date; 2023/09/17
ID;8
Author(s);PSPLIB report
Reference;Check PSPLIB website: http://www.om-db.wi.tum.de/psplib
Date; 1999/01/01
Hardware / software;Not reported
Stop criteria;Results reported from several authors, UBs, LBs and optimal runs
Submission date; 2017/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:18031818.
Date; 1992/01/01
Hardware / software; i7, 16GB, 2GHz, C++, Visual Studio 2015 (x64), Windows 10
Stop criteria;1m and 1h runs
Submission date; 2016/01/01
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: 1000 runs x 500k schedules
Submission date; 2017/5/21
ID;4
Author(s);Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G.
Reference;"Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.G. (2011) ""Explaining the cumulative propagator"". Constraints 16: 250. https://doi.org/10.1007/s10601-010-9103-2"
Date; 2011/07/01
Hardware / software;X86-64 architecture running GNU/Linux and a Intel(R) Xeon(R) CPU E54052 processor with 2 GHz. Code in Mercury using the G12 Constraint Programming Platform
Stop criteria(s);10 min, results reported in the paper as new results at the time of publication
Submission date; 2019/10/28
ID;5
Author(s);Petr Vil?m
Reference;Vil?m, P. (2011). Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources. International Conference on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems, 16. https://doi.org/10.1007/978-3-642-21311-3_22
Date;2011
Hardware / software;Intel(R) Core(TM)2 Duo CPU T9400 on 2.53GHz
Stop criteria;time limit for each improvement step is 60 seconds
Submission date;2021
ID;6
Author(s); Coelho, J. and Vanhoucke, M.
Reference;"Coelho, Jose, 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; 2017/06/01
Hardware / software; STEVIN HPC-UGent infrastructure, C++, compiler intel/2017.02, Linux
Stop criteria(s);Best results from all runs, with maximal run time of 1h
Submission date; 2017/12/30
ID;7
Author(s);Creemers, Stefan
Reference;Creemers Stefan, 2021, The resource-constrained project scheduling problem: New benchmark results, 17th International Workshop on Project Management and Scheduling (PMS 2021), Toulouse (France), April 21-23, 2021.
Date; 2022/09/05
Hardware / software;Coded in C++, compiled in Visual Studio 2019 (64 bit), and run on a single thread of an Intel I5-4590K CPU running at 3.3GHz with 32GB of RAM using Windows 7.
Stop criteria(s);memory shortage.
Submission date; 2023/09/17
ID;8
Author(s);PSPLIB report
Reference;Check PSPLIB website: http://www.om-db.wi.tum.de/psplib
Date; 1999/01/01
Hardware / software;Not reported
Stop criteria;Results reported from several authors, UBs, LBs and optimal runs
Submission date; 2017/01/01
Best Known Solutions
Original Instances
File Header
Title;J60
Description;Dataset proposed in the paper Kolisch, R. and A. Sprecher (1996): PSPLIB - A project scheduling library, European Journal of Operational Research, Vol. 96,pp. 205--216.
Number;480
Format;sm
Description;Dataset proposed in the paper Kolisch, R. and A. Sprecher (1996): PSPLIB - A project scheduling library, European Journal of Operational Research, Vol. 96,pp. 205--216.
Number;480
Format;sm
Date