Błażewicz, J., Lenstra, J., & Kan, A. (1983). Scheduling subject to resource constraints classification and complexity. Discrete Applied Mathematics, 5, 11–24.
DOI: https://doi.org/10.1016/0166-218X(83)90012-4
Hartmann, S., & Briskorn, D. (2012). A Survey of Variants and Extensions of the ResourceConstrained Project Scheduling Problem. European Journal of Operational Research, 207(1), 1–14.
DOI: https://doi.org/10.1016/j.ejor.2009.11.005
Hartmann, S., & Kolisch, R. (2000). Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research, 127, 394–407.
DOI: https://doi.org/10.1016/S0377-2217(99)00485-3
He, Z., Wang, N., Jia, T., & Xu, Y. (2009). Simulated annealing and tabu search for multimode project payment scheduling. European Journal of Operational Research, 198(3), 688–696.
DOI: https://doi.org/10.1016/j.ejor.2008.10.005
Józefowska, J., & Węglarz, J. (Eds.). (2006). Perspectives in modern project scheduling. Springer.
DOI: https://doi.org/10.1007/978-0-387-33768-5
Klimek, M. (2010). Predyktywno-reaktywne harmonogramowanie produkcji z ograniczoną dostępnością zasobów (doctoral dissertation). AGH, Kraków.
Klimek, M., & Łebkowski, P. (2015a). Harmonogramowanie projektu rozliczanego etapowo. Kraków: AGH.
Klimek, M., & Łebkowski, P. (2015b). Heuristics for project scheduling with discounted cash flows optimisation. Bulletin of the Polish Academy of Sciences Technical Sciences, 63(3),613–622.
DOI: https://doi.org/10.1515/bpasts-2015-0072
Kolisch, R. (1996a). Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research, 90, 320–333.
DOI: https://doi.org/10.1016/0377-2217(95)00357-6
Kolisch, R. (1996b). Efficient priority rules for the resource-constrained project scheduling problem. Journal of Operations Management, 14, 179–192.
DOI: https://doi.org/10.1016/0272-6963(95)00032-1
Kolisch, R., & Hartmann, S. (2006). Experimental Investigation of Heuristics for ResourceConstrained Project Scheduling: An Update. European Journal of Operational Research, 74(1), 23–37.
DOI: https://doi.org/10.1016/j.ejor.2005.01.065
Kolisch, R., & Sprecher, A. (1997). PSPLIB – a project scheduling library. European Journal of Operational Research, 96, 205–216.
DOI: https://doi.org/10.1016/S0377-2217(96)00170-1
Mika, M., Waligóra, G., & Węglarz, J. (2005). Simulated annealing and tabu search for multimode resource-constrained project scheduling with positive discounted cash flows and different payment models. European Journal of Operational Research, 164(3), 639–668.
DOI: https://doi.org/10.1016/j.ejor.2003.10.053
Ulusoy, G., Sivrikaya-Serifoglu, F., & Sahin, S. (2001). Four Payment Models for the Multi-Mode Resource Constrained Project Scheduling Problem with Discounted Cash Flows. Annals of Operations Research, 102, 237–261.
DOI: https://doi.org/10.1023/A:1010914417817
Valls, V, Ballestin, F, & Quintanilla, S. (2005). Justification and RCPSP: a technique that pays. European Journal of Operational Research, 165(2), 375–386.
DOI: https://doi.org/10.1016/j.ejor.2004.04.008
Vanhoucke, M. (2006). A scatter search procedure for maximizing the net present value of a resourceconstrained project with fixed activity cash flows. Working Paper 2006/417, Gent, 1–23.
