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

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

1 2 3 ... 7 8 9 next

  1. Bianco, Lucio; Caramia, Massimiliano; Giordani, Stefano: Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities (2016)
  2. Faghih-Mohammadi, Fatemeh; Seifi, Abbas; Khalighi-Sikaroudi, Mohammad: A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting (2016)
  3. He, Jieguang; Chen, Xindu; Chen, Xin: A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling (2016)
  4. Hu, Xuejun; Cui, Nanfang; Demeulemeester, Erik; Bie, Li: Incorporation of activity sensitivity measures into buffer management to manage project schedule risk (2016)
  5. Kreter, Stefan; Rieck, Julia; Zimmermann, Jürgen: Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars (2016)
  6. Lamas, Patricio; Demeulemeester, Erik: A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations (2016)
  7. Li, Hongbo; Demeulemeester, Erik: A genetic algorithm for the robust resource leveling problem (2016)
  8. Poppenborg, Jens; Knust, Sigrid: A flow-based tabu search algorithm for the RCPSP with transfer times (2016)
  9. Schnell, Alexander; Hartl, Richard F.: On the efficient modeling and solution of the multi-mode resource-constrained project scheduling problem with generalized precedence relations (2016)
  10. Toffolo, Túlio A.M.; Santos, Haroldo G.; Carvalho, Marco A.M.; Soares, Janniele A.: An integer programming approach to the multimode resource-constrained multiproject scheduling problem (2016)
  11. Vanhoucke, Mario; Coelho, José: An approach using SAT solvers for the RCPSP with logical constraints (2016)
  12. Xiong, Jian; Leus, Roel; Yang, Zhenyu; Abbass, Hussein A.: Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project (2016)
  13. Beşikci, Umut; Bilge, Ümit; Ulusoy, Gündüz: Multi-mode resource constrained multi-project scheduling and resource portfolio problem (2015)
  14. Cheng, Junzilan; Fowler, John; Kempf, Karl; Mason, Scott: Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting (2015)
  15. Chu, Geoffrey; Stuckey, Peter J.: Dominance breaking constraints (2015)
  16. Creemers, Stefan: Minimizing the expected makespan of a project with stochastic activity durations under resource constraints (2015)
  17. Fu, Na; Lau, Hoong Chuin; Varakantham, Pradeep: Robust execution strategies for project scheduling with unreliable resources and stochastic durations (2015)
  18. Gutjahr, Walter J.: Bi-objective multi-mode project scheduling under risk aversion (2015)
  19. Letort, Arnaud; Carlsson, Mats; Beldiceanu, Nicolas: Synchronized sweep algorithms for scalable scheduling constraints (2015)
  20. Li, Haitao; Womer, Norman K.: Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming (2015)

1 2 3 ... 7 8 9 next