Skip to main content
SpringerLink
Log in

Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem

  • Conference paper
  • First Online:
Mathematical Optimization Theory and Operations Research (MOTOR 2019)

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

Abstract

We consider the resource-constrained project scheduling problem (RCPSP) with respect to the makespan minimization criterion. The problem accounts for technological constraints of activities precedence together with resource constraints. Activities preemptions are not allowed. The problem with renewable resources is NP-hard in the strong sense. We propose a variable neighborhood search algorithm with two neighborhoods. Numerical experiments based on standard RCPSP test dataset j120 from the PCPLIB library demonstrated that the proposed algorithm produces better results than existing algorithms in the literature for large-sized instances. For some instances from the dataset j120 the best known heuristic solutions were improved.

The work was supported by the program of fundamental scientific researches of the SB RAS, project No. 0314-2019-0014.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Blażewicz, J., Lenstra, J.K., Rinnoy Kan, A.H.G.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5(1), 11–24 (1983)

    Article  MathSciNet  Google Scholar 

  2. Brucker, P., Knust, S., Schoo, A., Thiele, O.: A branch and bound algorithm for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 107, 272–288 (1998)

    Article  Google Scholar 

  3. 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  Google Scholar 

  4. 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  Google Scholar 

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

    Article  Google Scholar 

  6. Gagnon, M., Boctor, F.F., d’Avignon, G.: A Tabu Search Algorithm for the Resource-constrained Project Scheduling Problem. ASAC (2004)

    Google Scholar 

  7. Gimadi, E.Kh.: 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 

  8. Gimadi, E.Kh., 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  Google Scholar 

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

    Google Scholar 

  10. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)

    Book  Google Scholar 

  11. 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)

    Article  Google Scholar 

  12. Goncharov, E.N., Leonov, V.V.: Genetic algorithm for the resource-constrained project scheduling problem. Autom. Remote Control 78(6), 1101–1114 (2017)

    Article  MathSciNet  Google Scholar 

  13. Goncharov, E.N.: Stochastic greedy algorithm for the resource-constrained project scheduling problem. Diskret. Anal. Issled. Oper. 21(3), 10–23 (2014)

    MathSciNet  Google Scholar 

  14. Hansen, P., Mladenovic, N.: Developments of variable neighborhood search. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys of Metaheuristics, pp. 415–440. Kluwer Academic Publishers, Boston (2002)

    Chapter  Google Scholar 

  15. 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  Google Scholar 

  16. Hartmann, S.: A competitive genetic algorithm for the resource-constrained project scheduling. Naval Res. Logistics. 45, 733–750 (1998)

    Article  MathSciNet  Google Scholar 

  17. Hartmann, S.: A self-adaptive genetic algorithm for project scheduling under resource constraints. Naval Res. Logistics. 49, 433–448 (2002)

    Article  MathSciNet  Google Scholar 

  18. Herroelen, W., De Reyck, B., Demeulemeester, E.: Resource-constrained project scheduling: a survey of recent developments. Comput. Oper. Res. 25(4), 279–302 (1998)

    Article  MathSciNet  Google Scholar 

  19. 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, vol. 14(1), pp. 77–106. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

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

    Google Scholar 

  21. Kolisch, R., Padman, R.: An integrated survey of deterministic project scheduling. Omega 49(3), 249–272 (2001)

    Article  Google Scholar 

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

    Article  Google Scholar 

  23. 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, pp. 147–178. Kluwer Academic Publishers (1999)

    Google Scholar 

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

    Article  Google Scholar 

  25. 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/

    Article  Google Scholar 

  26. 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  Google Scholar 

  27. Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manage. Sci. 44, 715–729 (1998)

    Article  Google Scholar 

  28. 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)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  30. 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 

  31. Sprecher, A.: Scheduling resource-constrained projects competitively at modest resource requirements. Manage. Sci. 46, 710–723 (2000)

    Article  Google Scholar 

  32. Tormos, P., Lova, A.: A competitive heuristic solution techniques for resource-consrtained project scheduling. Ann. Oper. Res. 102, 65–81 (2001)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  34. 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  Google Scholar 

  35. Valls, V., Ballestin, F., Quintanilla, S.: A population-based approach to the resource-constrained project scheduling problem. Ann. Oper. Res. 131, 305–324 (2004)

    Article  MathSciNet  Google Scholar 

  36. 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 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, prosp. Akad. Koptyuga, 4, Novosibirsk, Russia

    Evgenii N. Goncharov

  2. Novosibirsk State University, str. Pirogova, 1, Novosibirsk, Russia

    Evgenii N. Goncharov

Authors
  1. Evgenii N. Goncharov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Evgenii N. Goncharov .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics, Novosibirsk, Russia

    Igor Bykadorov

  2. University of Greenwich, London, UK

    Vitaly Strusevich

  3. University of Aveiro, Aveiro, Portugal

    Tatiana Tchemisova

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Goncharov, E.N. (2019). Variable Neighborhood Search for the Resource Constrained Project Scheduling Problem. In: Bykadorov, I., Strusevich, V., Tchemisova, T. (eds) Mathematical Optimization Theory and Operations Research. MOTOR 2019. Communications in Computer and Information Science, vol 1090. Springer, Cham. https://doi.org/10.1007/978-3-030-33394-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-33394-2_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-33393-5

  • Online ISBN: 978-3-030-33394-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation