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 212 articles , 1 standard article )

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

1 2 3 ... 9 10 11 next

  1. 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)
  2. Brčić, Mario; Katić, Marija; Hlupić, Nikica: Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems (2019)
  3. Burgelman, Jeroen; Vanhoucke, Mario: Computing project makespan distributions: Markovian PERT networks revisited (2019)
  4. Creemers, Stefan: The preemptive stochastic resource-constrained project scheduling problem (2019)
  5. Davari, Morteza; Demeulemeester, Erik: Important classes of reactions for the proactive and reactive resource-constrained project scheduling problem (2019)
  6. 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)
  7. Atan, Tankut; Eren, Elif: Optimal project duration for resource leveling (2018)
  8. Baptiste, Philippe; Bonifas, Nicolas: Redundant cumulative constraints to compute preemptive bounds (2018)
  9. 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)
  10. Burgelman, Jeroen; Vanhoucke, Mario: Maximising the weighted number of activity execution modes in project planning (2018)
  11. Carlier, J.; Moukrim, A.; Sahli, A.: Lower bounds for the event scheduling problem with consumption and production of resources (2018)
  12. Chen, Zhi; Demeulemeester, Erik; Bai, Sijun; Guo, Yuntao: Efficient priority rules for the stochastic resource-constrained project scheduling problem (2018)
  13. Coelho, José; Vanhoucke, Mario: An exact composite lower bound strategy for the resource-constrained project scheduling problem (2018)
  14. Cui, Wan-An: Critical sequences and resource links optimization in resource-constrained project scheduling (2018)
  15. Dolgui, Alexandre; Kovalev, Sergey; Kovalyov, Mikhail Y.; Malyutin, Sergey; Soukhal, Ameur: Optimal workforce assignment to operations of a paced assembly line (2018)
  16. Fouilhoux, Pierre; Mahjoub, A. Ridha; Quilliot, Alain; Toussaint, Hélène: Branch-and-cut-and-price algorithms for the preemptive RCPSP (2018)
  17. Gerhards, Patrick; Stürck, Christian: A hybrid metaheuristic for the multi-mode resource investment problem with tardiness penalty (2018)
  18. Kreter, Stefan; Schutt, Andreas; Stuckey, Peter J.; Zimmermann, Jürgen: Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems (2018)
  19. Laborie, Philippe; Rogerie, Jérôme; Shaw, Paul; Vilím, Petr: IBM ILOG CP optimizer for scheduling. 20+ years of scheduling with constraints at IBM/ILOG (2018)
  20. Leeftink, Gréanne; Hans, Erwin W.: Case mix classification and a benchmark set for surgery scheduling (2018)

1 2 3 ... 9 10 11 next