The multi-project scheduling problem

The Resource-Constrained Multi-Project Scheduling Problem (RCMPSP) is an extension of the well known single-project RCPSP. It treats a portfolio of multiple projects that need to be scheduled simultaneously subject to precedence and resource constraints. As most companies have a portfolio of projects, this problem has gained more attention from academics in recent years. Several artificial benchmark datasets for this problem have been proposed. This manuscript proposes additional sets to complement the existing sets and compares them with each other. 

Save time and download everything at once!


In order to facilitate the comparison of different datasets, we converted all existing benchmark sets to the same format (.rcmp). The file format is explained in the file "Blueprint RCMP.txt".
Furthermore, each set is accompanied by a csv-file containing resource and network information about each of the instances.

Existing data

Data from the following papers were converted to the .rcmp file format:
Homberger, J. (2007). A multi-agent system for the decentralized resource-constrained multi-project scheduling problem. International Transactions in Operational Research, 14(6):565-589
Homberger, J. (2012). A ()-coordination mechanism for agent-based multi-project scheduling. OR spectrum, 34(1):107-132.
Vázquez, E. P., Calvo, M. P., and Ordóñez, P. M. (2015). Learning process on priority rules to solve the rcmpsp. Journal of Intelligent Manufacturing, 26(1):123-138.
3. BY: (BY.zip)
Browning, T. R., and Yassine, A. A. (2010a). A random generator of resource-constrained multi-project network problems. Journal of scheduling, 13(2):143-161.

New data of paper 1 (Journal of Scheduling)

The following datasets were designed by the Operations Research and Scheduling group in the first paper:


New data of paper 2 (under submission)

The following datasets were designed by the Operations Research and Scheduling group in a second paper:

  • Set 1.  Instances with no precedence relations between projects (MP= 0, MF= 1) and all projects use all resource types (CR=1)
  • Set 2. Instances with interproject precedence relations and but all projects use all resource types (CR=1)
  • Set 3. Instances with no precedence relations between projects, but CR, RD and PD are varied
  • Set 4. Instances for which all parameters values vary within a range (all combinations)


  • Van Eynde, R. and Vanhoucke, M., New summary measures and datasets for the multi- project scheduling problem. Paper under submission