Skip to main content

An Improved Genetic Algorithm for the Resource-Constrained Project Scheduling Problem

  • Conference paper
  • First Online:
Advances in Optimization and Applications (OPTIMA 2022)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1739))

Included in the following conference series:

  • 244 Accesses

Abstract

This paper presents an improved genetic algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). The schedules are constructed using a heuristic that builds active schedules based on priorities that takes into account the degree of criticality for the resources. The degree of resource’s criticality is derived from the solution of a relaxed problem with a constraint on accumulative resources. The computational results with instances from the PCPLIB library validate the effectiveness of the proposed algorithm. We have obtain some of the best average deviations of the solutions from the critical path value. The best known solutions have been improved for some instances from the PCPLIB.

The study was carried out within the framework of the state contract of the Sobolev Institute of Mathematics (project FWNF-2022-0019).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abdolshah, M.: A review of resource-constrained project scheduling problems (RCPSP) approaches and solutions. Int. Trans. J. Eng. Manag. Appl. Sci. Technol. 5(4), 253–286 (2014)

    Google Scholar 

  2. Alcaraz, J., Maroto, C.: A hybrid genetic algorithm based on intelligent encoding for project scheduling. In: Józefowska, J., Weglarz, J. (eds.) Perspectives in Modern Project Scheduling, pp. 249–274. Springer, Boston (2006). https://doi.org/10.1007/978-0-387-33768-5_10

    Chapter  MATH  Google Scholar 

  3. Berthaut, F., Pellerin, R., Hajji, A., Perrier, N.: A path relinking-based scatter search for the resource-constrained project scheduling problem. Int. J. Project Organ. Manag. 10(1), 1–36 (2018)

    Google Scholar 

  4. Blazewicz, J., Lenstra, J.K., Kan, A.R.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1), 11–24 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  5. Brucker, P., Drexl, A., Möhring, R., et al.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3–41 (1999)

    Article  MATH  Google Scholar 

  6. Carlier, J., Moukrim, A., Xu, H.: A memetic algorithm for the resource constrained project scheduling problem. In: Proceedings of the International Conference on Industrial Engineering and Systems Management, IESM (2009)

    Google Scholar 

  7. Chen, D., Liu, S., Qin, S.: Memetic algorithm for the resource-constrained project scheduling problem. In: Proceeding of the 11th World Congress on Intelligent Control and Automation, WCICA, pp. 4991–4996. IEEE (2014)

    Google Scholar 

  8. Czogalla, J., Fink, A.: Particle swarm topologies for resource constrained project scheduling. In: Krasnogor, N., et al. (eds.) NICSO 2008, pp. 61–73. Springer-Verlag, Berlin Heidelberg (2009). https://doi.org/10.1007/978-3-642-03211-0_6

    Chapter  MATH  Google Scholar 

  9. Debels, D., De Reyck Leus, B.R., Vanhoucke, M.: A hybrid scatter search electromagnetism meta-heuristic for project scheduling. Eur. J. Oper. Res. 169, 638–653 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Debels, D., Vanhoucke, M.: Decomposition-based genetic algorithm for the resource-consrtained project scheduling problem. Oper. Res. 55, 457–469 (2007)

    Article  MATH  Google Scholar 

  11. Elsayed, S., Sarker, R., Ray, T., Coello, C.C.: Consolidated optimization algorithm for resource-constrained project scheduling problems. Inf. Sci. 418–419, 346–362 (2017)

    Article  Google Scholar 

  12. Fang, C., Wang, L.: An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. Comput. Oper. Res. 39(5), 890–901 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gagnon, M., Boctor, F.F., d’Avignon, G.: A tabu search algorithm for the resource-constrained project scheduling problem. In: ASAC (2004)

    Google Scholar 

  14. Gimadi, E.K.: On some mathematical models and methods for planning large-scale projects. Models and Optimization Methods. In: Proceedings an USSR Sib. Branch, Math. Inst., Novosibirsk. Nauka, vol. 10, pp. 89–115 (1988)

    Google Scholar 

  15. Gimadi, E.K., Goncharov, E.N., Mishin, D.V.: On some implementations of solving the resource-constrained project scheduling problem. Yugoslav J. Oper. Res. 29(1), 31–42 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  16. Gimadi, E.K., Zalyubovskii, V.V., Sevast’yanov, S.V.: Polynomial solvability of scheduling problems with storable resources and deadlines. Diskretnyi Analiz i Issledovanie Operazii 7(1), 9–34 (2000)

    MathSciNet  Google Scholar 

  17. Goncalves, J., Resende, M.G.C., Mendes, J.: A biased random key genetic algorithm with forward-backward improvement for resource-constrained project scheduling problem. J. Heuristics. 17, 467–486 (2011). https://doi.org/10.1007/s10732-010-9142-2

    Article  Google Scholar 

  18. Goncharov, E.N., Leonov, V.V.: Genetic algorithm for the resource-constrained project scheduling problem. Autom Remote Control 78(6), 1101–1114 (2017). https://doi.org/10.1134/S0005117917060108

    Article  MathSciNet  MATH  Google Scholar 

  19. Goncharov, E.N.: Variable neighborhood search for the resource constrained project scheduling problem. In: Bykadorov, I., Strusevich, V., Tchemisova, T. (eds.) MOTOR 2019. CCIS, vol. 1090, pp. 39–50. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-33394-2_4

    Chapter  Google Scholar 

  20. Goncharov, E.N.: Local search algorithm for the resource-constrained project scheduling problem. Diskret. Anal. Issled. Oper. 29(4), 15–37 (2022)

    Google Scholar 

  21. Hartmann, S., Briskorn, D.: A survey of variants and extentions of the resource-constrained project scheduling problem. Eur. J. Oper. Res. 207, 1–14 (2010)

    Article  MATH  Google Scholar 

  22. Herroelen, W., Demeulemeester, E., De Reyck, B.: A Classification Scheme for Project Scheduling. In: Weglarz J. (Ed.). Project Scheduling-Recent Models, Algorithms and Applications, International Series in Operations Research and Management Science. Kluwer Academic Publishers, Dordrecht, vol. 14, no. 1, pp. 77–106 (1998)

    Google Scholar 

  23. Ismail, I.Y., Barghash, M.A.: Diversity guided genetic algorithm to solve the resource constrained project scheduling problem. Int. J. Plan. Sched. 1(3), 147–170 (2012)

    Google Scholar 

  24. Jedrzejowicz, P., Ratajczak, E.: Population learning algorithm for the resource-constrained project scheduling. In: Józefowska, J., Weglarz, J. (eds.) Perspectives in Modern Project Scheduling, pp. 275–296. Springer, Boston (2006). https://doi.org/10.1007/978-0-387-33768-5_11

    Chapter  MATH  Google Scholar 

  25. Kochetov, Y., Stolyar, A.: Evolutionary local search with variable neighborhood for the resource-constrained project scheduling problem. In: Proceedings of the 3th International Workshop of Computer Science and Information Technologies, vol. 96–99 (2003)

    Google Scholar 

  26. Kolisch, R., Hartmann, S.: Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur. J. Oper. Res. 174, 23–37 (2006)

    Article  MATH  Google Scholar 

  27. Kolisch, R., Hartmann, S.: Heuristic Algorithms for Solving the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis. In: Weglarz J., (ed). Project scheduling: Recent models, Algorithms and Applications. Kluwer Academic Publishers, pp. 147–178 (1999)

    Google Scholar 

  28. Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Manag. Sci. 41, 1693–1703 (1995)

    Article  MATH  Google Scholar 

  29. Kolisch, R., Sprecher, A.: PSPLIB – a project scheduling problem library. Eur. J. Oper. Res. 96, 205–216 (1996). http://www.om-db.wi.tum.de/psplib/

  30. Koulinas, G., Kotsikas, L., Anagnostopoulos, K.: A particle swarm optimization based hyper-heuristic algorithm for the classic resource constrained project scheduling problem. Inf. Sci. 277, 680–693 (2014)

    Article  Google Scholar 

  31. Lim, A., Ma, H., Rodrigues, B., Tan, S.T., Xiao, F.: New meta-heuristics for the resource-constrained project scheduling problem. Flex. Serv. Manuf. J. 25(1–2), 48–73 (2013). https://doi.org/10.1007/s10696-011-9133-0

    Article  Google Scholar 

  32. Mendes, J.J.M., Goncalves, J.F., Resende, M.G.C.: A random key based genetic algorithm for the resource constrained project scheduling problem. Comput. Oper. Res. 36, 92–109 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  33. Mobini, M.D.M., Rabbani, M., Amalnik, M.S., et al.: Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem. Soft Comput. 13, 597–610 (2009). https://doi.org/10.1007/s00500-008-0337-5

    Article  Google Scholar 

  34. Mobini, M., Mobini, Z., Rabbani, M.: An artificial immune algorithm for the project scheduling problem under resource constraints. Appl. Soft Comput. 11(2), 1975–1982 (2011)

    Article  Google Scholar 

  35. Palpant, M., Artigues, C., Michelon, P.: Solving the resource-constrained project scheduling problem with large neighborhood search. Ann. Oper. Res. 131, 237–257 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  36. Pellerin, R., Perrier, N., Berthaut, F.: LSSPER: A survey of hybrid metaheuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 280(2), 395–416 (2020)

    Article  MATH  Google Scholar 

  37. Proon, S., Jin, M.: A genetic algorithm with neighborhood search for the resource-consrtained project scheduling problem. Naval Res. Logist. 58, 73–82 (2011)

    Article  MathSciNet  Google Scholar 

  38. Ranjbar, M., Kianfar, F.: A hybrid scatter search for the RCPSP. Sci. Iranica 16(1), 11–18 (2009)

    Google Scholar 

  39. Paraskevopoulos, D.C., Tarantilis, C.D., Ioannou, G.: Solving project scheduling problems with resource constraints via an event list-based evolutionary algorithm. Expert Syst. Appl. 39(4), 3983–3994 (2012)

    Article  Google Scholar 

  40. Valls, V., Ballestin, F., Quintanilla, M.S.: Justification and RCPSP: a technique that Pays. Eur. J. Oper. Res. 165, 375–386 (2005)

    Article  MATH  Google Scholar 

  41. Valls, V., Ballestin, F., Quintanilla, S.: A hybrid genetic algorithm for the resource-consrtained project scheduling problem. Eur. J. Oper. Res. 185(2), 495–508 (2008)

    Article  MATH  Google Scholar 

  42. Valls, V., Ballestin, F., Quintanilla, S.: A population-based approach to the resource-constrained project scheduling problem. Ann. Oper. Res. 131, 305–324 (2004). https://doi.org/10.1023/B:ANOR.0000039524.09792.c9

    Article  MathSciNet  MATH  Google Scholar 

  43. Vanhoucke, M.: Resource-constrained project scheduling. In: Project Management with Dynamic Scheduling. Springer-Verlag, Heidelberg, pp. 107–137 (2012). https://doi.org/10.1007/978-3-642-25175-7_7

  44. Chen, W., Shi, Y.J., Teng, H.F., et al.: An efficient hybrid algorithm for resource-constrained project scheduling. Inf. Sci. 180(6), 1031–1039 (2010)

    Article  Google Scholar 

  45. Wang, H., Li, T., Lin, T.: Efficient genetic algorithm for resource-constrained project scheduling problem. Trans. Tianjin Univ. 16(5), 376–382 (2010). https://doi.org/10.1007/s12209-010-1495-y

    Article  Google Scholar 

  46. Weglarz, J.: Project Scheduling: Recent Models, Algorithms and Applications. Kluwer Academic Publishers, Boston (1999)

    Book  Google Scholar 

  47. Ying, K.C., Lin, S.W., Lee, Z.J.: Hybrid-directional planning: improving improvement heuristics for scheduling resource-constrained projects. Int. J. Adv. Manuf. Technol. 41(3–4), 358–366 (2009). https://doi.org/10.1007/s00170-008-1486-5

    Article  Google Scholar 

  48. Zamani, R.: A competitive magnet-based genetic algorithm for solving the resource-constrained project scheduling problem. Eur. J. Oper. Res. 229(2), 552–559 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  49. Zheng, X., Wang, L.: A multi-agent optimization algorithm for resource constrained project scheduling problem. Expert Syst. Appl. 42(15–16), 6039–6049 (2015)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Evgenii N. Goncharov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Goncharov, E.N. (2022). An Improved Genetic Algorithm for the Resource-Constrained Project Scheduling Problem. In: Olenev, N., Evtushenko, Y., Jaćimović, M., Khachay, M., Malkova, V., Pospelov, I. (eds) Advances in Optimization and Applications. OPTIMA 2022. Communications in Computer and Information Science, vol 1739. Springer, Cham. https://doi.org/10.1007/978-3-031-22990-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-22990-9_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-22989-3

  • Online ISBN: 978-3-031-22990-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics