PSPLIB

PSPLIB -- a project scheduling problem library. We present a set of benchmark instances for the evaluation of solution procedures for single- and multi-mode resource-constrained project scheduling problems. The instances have been systematically generated by the standard project generator ProGen. They are characterized by the input-parameters of ProGen. The entire benchmark set including its detailed characterization and the best solutions known so-far are available on a public ftp-site. Hence, researchers can download the benchmark sets they need for the evaluation of their algorithms. Additionally, they can make available new results. Depending on the progress made in the field, the instance library will be continuously enlarged and new results will be made accessible. This should be a valuable and driving source for further improvements in the area of project type scheduling.


References in zbMATH (referenced in 245 articles , 1 standard article )

Showing results 1 to 20 of 245.
Sorted by year (citations)

1 2 3 ... 11 12 13 next

  1. Araujo, Janniele A. S.; Santos, Haroldo G.; Gendron, Bernard; Jena, Sanjay Dominik; Brito, Samuel S.; Souza, Danilo S.: Strong bounds for resource constrained project scheduling: preprocessing and cutting planes (2020)
  2. Jeunet, Jully; Bou Orm, Mayassa: Optimizing temporary work and overtime in the time cost quality trade-off problem (2020)
  3. Kosztyán, Zsolt T.; Szalkai, István: Multimode resource-constrained project scheduling in flexible projects (2020)
  4. Pellerin, Robert; Perrier, Nathalie; Berthaut, François: A survey of hybrid metaheuristics for the resource-constrained project scheduling problem (2020)
  5. Sabeghi, Narjes; Tareghian, Hamed Reza: Using the generalized maximum covering location model to control a project’s progress (2020)
  6. Tesch, Alexander: A polyhedral study of event-based models for the resource-constrained project scheduling problem (2020)
  7. Van Den Eeckhout, M.; Vanhoucke, M.; Maenhout, B.: A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems (2020)
  8. Arkhipov, Dmitry; Battaïa, Olga; Lazarev, Alexander: An efficient pseudo-polynomial algorithm for finding a lower bound on the makespan for the resource constrained project scheduling problem (2019)
  9. Brčić, Mario; Katić, Marija; Hlupić, Nikica: Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems (2019)
  10. Burgelman, Jeroen; Vanhoucke, Mario: Computing project makespan distributions: Markovian PERT networks revisited (2019)
  11. Creemers, Stefan: The preemptive stochastic resource-constrained project scheduling problem (2019)
  12. Davari, Morteza; Demeulemeester, Erik: The proactive and reactive resource-constrained project scheduling problem (2019)
  13. Davari, Morteza; Demeulemeester, Erik: Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem (2019)
  14. Hu, Xuejun; Wang, Jianjiang; Leng, Kaijun: The interaction between critical chain sequencing, buffer sizing, and reactive actions in a CC/BM framework (2019)
  15. van den Eeckhout, M.; Maenhout, B.; Vanhoucke, M.: A heuristic procedure to solve the project staffing problem with discrete time/resource trade-offs and personnel scheduling constraints (2019)
  16. Zamani, Reza: An innovative four-layer heuristic for scheduling multi-mode projects under multiple resource constrains (2019)
  17. Atan, Tankut; Eren, Elif: Optimal project duration for resource leveling (2018)
  18. Baptiste, Philippe; Bonifas, Nicolas: Redundant cumulative constraints to compute preemptive bounds (2018)
  19. Bruni, M. E.; Di Puglia Pugliese, L.; Beraldi, P.; Guerriero, F.: A computational study of exact approaches for the adjustable robust resource-constrained project scheduling problem (2018)
  20. Burgelman, Jeroen; Vanhoucke, Mario: Maximising the weighted number of activity execution modes in project planning (2018)

1 2 3 ... 11 12 13 next