Dataset File
Description
"Van Peteghem, V. and Vanhoucke, M., 2014, ""An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances"", European Journal of Operational Research, 235(1), 62–72 (doi:10.1016/j.ejor.2013.10.012)."
Number of instances
540
Format
mm
Statistics
Set statistics:
Number of instances: 540
- Solved (exact proc.): 450 (83.33%)
- Closed (LB=UB): 458 (84.81%)
- Open (LB<UB): 82 (15.19%)
Average deviation over CPM:
- Lower bound: 20.61%
- Upper bound: 22.28%
Sum of lower bounds: 19145
Sum of upper bounds: 19435
Open time units: 290 (1.51%)
Avg CPU lower bounds: 447.221s (max 69709.654s)
Avg CPU upper bounds: 473.785s (max 4753.000s)
Avg CPU optimal sol.: 595.679s (max 69709.654s)
Reference 2:
- Lower bounds: 197 (36.48%)
Reference 1:
- Upper bounds: 505 (93.52%)
Reference 4:
- Lower bounds: 7 (1.30%)
- Upper bounds: 25 (4.63%)
- Optimal solutions: 450 (83.33%)
Reference 3:
- Lower bounds: 98 (18.15%)
Reference 5:
- Upper bounds: 10 (1.85%)
Number of instances: 540
- Solved (exact proc.): 450 (83.33%)
- Closed (LB=UB): 458 (84.81%)
- Open (LB<UB): 82 (15.19%)
Average deviation over CPM:
- Lower bound: 20.61%
- Upper bound: 22.28%
Sum of lower bounds: 19145
Sum of upper bounds: 19435
Open time units: 290 (1.51%)
Avg CPU lower bounds: 447.221s (max 69709.654s)
Avg CPU upper bounds: 473.785s (max 4753.000s)
Avg CPU optimal sol.: 595.679s (max 69709.654s)
Reference 2:
- Lower bounds: 197 (36.48%)
Reference 1:
- Upper bounds: 505 (93.52%)
Reference 4:
- Lower bounds: 7 (1.30%)
- Upper bounds: 25 (4.63%)
- Optimal solutions: 450 (83.33%)
Reference 3:
- Lower bounds: 98 (18.15%)
Reference 5:
- Upper bounds: 10 (1.85%)
RecordSets
Record sets:
ID;1
Author(s); Coelho J., Vanhoucke M.
Reference; Coelho J., Vanhoucke M. 2011. 'Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers', European Journal of Operational Research 213, 1: 73 - 82.
Date; 2011/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/26
ID;2
Author(s);Schnell, A., & Hartl, R. F.
Reference;Schnell, A., & Hartl, R. F. (2017). On the generalization of constraint programming and boolean satisfiability solving techniques to schedule a resource-constrained project consisting of multi-mode jobs. Operations Research Perspectives, 4, 1–11. https://doi.org/10.1016/j.orp.2017.01.002
Date;16.01.2017
Hardware / software;Vienna Scientific Cluster. X86-64 architecture running under Red Hat/Linux with two sixcore Intel Westmere X5650 processors of 2,66GHz and with 24GB RAM.
Stop criteria;5400 s
Submission date;16.01.2017
ID;3
Author(s);Stürck, Christian
Reference;Stürck, Christian (2018) Exakte Methoden und Matheuristiken für das Multi-Mode Resource-Constrained Project Scheduling Problem (Exact and matheuristic approaches for the multi-mode resource-constrained project scheduling problem), Dissertation (Helmut Schmidt University Hamburg), Wissenschaftlicher Verlag Berlin, Berlin.
Date;20.02.2018
Hardware / software;Intel Xeon X5650 Prozessor, 2,66 GHz, C#, Visual Studio 2015 (x64), IBM ILOG CPLEX 12.6.3
Stop criteria;maximum of 1800 seconds
Submission date;23.04.2018
ID;4
Author(s);Araujo, J. A. S., Santos, H. G., Gendron, B., Jena, S. D., Brito, S. S., & Souza, D. S.
Reference;Araujo, J. A. S., Santos, H. G., Gendron, B., Jena, S. D., Brito, S. S., & Souza, D. S. (2020). Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes. Computers & Operations Research, 113, 104782. https://doi.org/10.1016/j.cor.2019.104782
Date;2020
Hardware / software;All computational experiments have been carried out on a computing cluster (Compute Canada) composed by Intel ® Xeon X5650 Westmere processors with 2,67 GHz and 512 GB of RAM running Scientific Linux release 6.3. All algorithms were coded in ANSI C 99 and compiled with GCC version 5.4.0, with flags -Ofast and solver GUROBI version 8.0.1 (Gurobi Optimization, 2016).
Stop criteria;86000 seconds
Submission date;2021
ID;5
Author(s);Several authors
Reference;Data downloaded from the site www.mmlib.eu
Date;23.04.2018
Hardware / software;not specified
Stop criteria;none
Submission date;23.04.2018
ID;1
Author(s); Coelho J., Vanhoucke M.
Reference; Coelho J., Vanhoucke M. 2011. 'Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers', European Journal of Operational Research 213, 1: 73 - 82.
Date; 2011/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/26
ID;2
Author(s);Schnell, A., & Hartl, R. F.
Reference;Schnell, A., & Hartl, R. F. (2017). On the generalization of constraint programming and boolean satisfiability solving techniques to schedule a resource-constrained project consisting of multi-mode jobs. Operations Research Perspectives, 4, 1–11. https://doi.org/10.1016/j.orp.2017.01.002
Date;16.01.2017
Hardware / software;Vienna Scientific Cluster. X86-64 architecture running under Red Hat/Linux with two sixcore Intel Westmere X5650 processors of 2,66GHz and with 24GB RAM.
Stop criteria;5400 s
Submission date;16.01.2017
ID;3
Author(s);Stürck, Christian
Reference;Stürck, Christian (2018) Exakte Methoden und Matheuristiken für das Multi-Mode Resource-Constrained Project Scheduling Problem (Exact and matheuristic approaches for the multi-mode resource-constrained project scheduling problem), Dissertation (Helmut Schmidt University Hamburg), Wissenschaftlicher Verlag Berlin, Berlin.
Date;20.02.2018
Hardware / software;Intel Xeon X5650 Prozessor, 2,66 GHz, C#, Visual Studio 2015 (x64), IBM ILOG CPLEX 12.6.3
Stop criteria;maximum of 1800 seconds
Submission date;23.04.2018
ID;4
Author(s);Araujo, J. A. S., Santos, H. G., Gendron, B., Jena, S. D., Brito, S. S., & Souza, D. S.
Reference;Araujo, J. A. S., Santos, H. G., Gendron, B., Jena, S. D., Brito, S. S., & Souza, D. S. (2020). Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes. Computers & Operations Research, 113, 104782. https://doi.org/10.1016/j.cor.2019.104782
Date;2020
Hardware / software;All computational experiments have been carried out on a computing cluster (Compute Canada) composed by Intel ® Xeon X5650 Westmere processors with 2,67 GHz and 512 GB of RAM running Scientific Linux release 6.3. All algorithms were coded in ANSI C 99 and compiled with GCC version 5.4.0, with flags -Ofast and solver GUROBI version 8.0.1 (Gurobi Optimization, 2016).
Stop criteria;86000 seconds
Submission date;2021
ID;5
Author(s);Several authors
Reference;Data downloaded from the site www.mmlib.eu
Date;23.04.2018
Hardware / software;not specified
Stop criteria;none
Submission date;23.04.2018
Relevant Results
Best Known Solutions
Original Instances
File Header
Description;"Van Peteghem, V. and Vanhoucke, M., 2014, ""An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances"", European Journal of Operational Research, 235(1), 62–72 (doi:10.1016/j.ejor.2013.10.012)."
Number;540
Format;mm
Number;540
Format;mm
Date