Skip to main content
SpringerLink
Log in

A Local Search Algorithm for the Resource-Constrained Project Scheduling Problem

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

We consider the resource-constrained project scheduling problem (RCPSP). The problem accounts for technological constraints of activities precedence together with resource constraints. All resources are renewable. Activities interruptions are not allowed. This problem is NP-hard in the strong sense. We present a new local search algorithm that uses a Tabu-list and two types of neighborhoods. The algorithm is evaluated using three data bases of instances of the problem: 480 instances of 60 activities, 480 of 90, and 600 of 120 activities, respectively, taken from the PSPLIB library available online. Numerical experiments demonstrate that the proposed algorithm produces better results than existing algorithms described in the literature for large-sized instances. For some instances from the dataset j120, the best known heuristic solutions were improved.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

REFERENCES

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

    Article  MATH  Google Scholar 

  2. J. Blaűewicz, J.K. Lenstra, and A. H. G. Rinnoy Kan, “Scheduling subject to resource constraints: Classification and complexity,” Discr. Appl. Math. 5 (1), 11–24 (1983).

    Article  MathSciNet  Google Scholar 

  3. E. Kh. Gimadi, “On some mathematical models and methods for planning large-scale projects. Models and optimization methods,” Tr. Akad. Nauk SSSR. Sib. Otd. Inst. Mat. (Nauka, Novosibirsk) 10, 89–115 (1988).

  4. E. Kh. Gimadi, V. V. Zalyubovskii, and S.V. Sevast’yanov, “Polynomial solvability of scheduling problems with storable resources and deadlines,” Diskr. Anal. Issled. Oper. Ser. 2 7 (1), 9–34 (2000).

    MathSciNet  Google Scholar 

  5. R. Pellerin, N. Perrier, and F. Berthaut, “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 

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

    Google Scholar 

  7. M. Vanhoucke, “Resource-constrained project scheduling,” in Project Management with Dynamic Scheduling (Springer-Verlag, Heidelberg–Berlin, 2012) 107–137.

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Yu. A. Kochetov and A. A. Stolyar, “Evolutionary local search with variable neighborhood for the resource-constrained project scheduling problem,” Proc. 3rd Int. Workshop Comput. Sci. Inf. Technol. (Ufa, Russia, September 16–18, 2003) (USATU, Ufa, 2003), 96–99.

  12. E.N. Goncharov, “Variable neighborhood search for the resource constrained project scheduling problem,” in Springer Nature Switzerland AG 2019, I. Bykadorov et al. (Eds.), MOTOR 2019, CCIS 1090, 39–50 (2019).

  13. R. Kolisch and S. Hartmann, “Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis,” in Project scheduling: Recent Models, Algorithms and Applications, J. Weglarz (Ed.) (Kluwer, Heidelberg, 1999), 147–178.

  14. E. Kh. Gimadi, E. N. Goncharov, and D. V. Mishin, “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 

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

  16. S. Proon and M. Jin, “A genetic algorithm with neighborhood search for the resource-constrained project scheduling problem,” Naval Res. Logist. 58, 73–82 (2011).

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  18. R. Kolisch and A. Sprecher, “PSPLIB - a Project Scheduling Problem Library,” Eur. J. Oper. Res. 96, 205–216 (1996) (downloadable from http://www.om-db.wi.tum.de/psplib/).

  19. J. Weglarz, Project Scheduling. Recent Models, Algorithms and Applications, (Kluwer, Boston, 1999).

    Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  23. D. C. Paraskevopoulos, C. D. Tarantilis, and G. Ioannou, “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 

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

    Article  Google Scholar 

  25. M. D. M. Mobini, M. Rabbani, M. S. Amalnik, et al., “Using an enhanced scatter search algorithm for a resource-constrained project scheduling problem,” Soft Comput. 13, 597–610 (2009).

    Article  Google Scholar 

  26. H. Wang, T. Li, and T. Lin, “Efficient genetic algorithm for resource-constrained project scheduling problem,” Trans. Tianjin Univ. 16 (5), 376–382 (2010).

    Article  Google Scholar 

  27. J. Goncalves, M. G. C. Resende, and J. Mendes, “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 

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

    Article  Google Scholar 

  29. J. Czogalla and A. Fink, “Particle swarm topologies for resource constrained project scheduling,” in Nature Inspired Cooperative Strategies for Optimization, N. Krasnogor et al. (Eds.) (Springer-Verlag, Berlin–Heidelberg, 2009) 61–73.

  30. A. Lim, H. Ma, B. Rodrigues, S. T. Tan, and F. Xiao, “New meta-heuristics for the resource-constrained project scheduling problem,” Flexible Serv. Manuf. J. 25 (1–2), 48–73 (2013).

    Article  Google Scholar 

  31. D. Chen, S. Liu, and S. Qin, “Memetic algorithm for the resource-constrained project scheduling problem,” Proc. 11th World Congress Intell. Control Autom., WCICA (2014) (IEEE, 2014) 4991–4996.

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

    Article  Google Scholar 

  33. R. Zamani, “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 

  34. C. Fang, and L. Wang, “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 

  35. I. Y. Ismail, and M. A. Barghash, “Diversity guided genetic algorithm to solve the resource constrained project scheduling problem,” Int. J. Plann. Scheduling 1 (3), 147–170 (2012).

    Article  Google Scholar 

  36. Wang Chen, Yan-jun Shi, Hong-fei Teng, et al., “An efficient hybrid algorithm for resource-constrained project scheduling,” Inf. Sci. 180 (6), 1031–1039 (2010).

    Article  Google Scholar 

  37. J. J. M. Mendes, J. F. Goncalves, and M. G. C. Resende, “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 

  38. D. Debels and M. Vanhoucke, “Decomposition-based genetic algorithm for the resource-constrained project scheduling problem,” Oper. Res. 55, 457–469 (2007).

    Article  MATH  Google Scholar 

  39. G. Koulinas, L. Kotsikas, and K. Anagnostopoulos, “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 

  40. V. Valls, F. Ballestin, and S. Quintanilla, “A hybrid genetic algorithm for the resource-constrained project scheduling problem,” Eur. J. Oper. Res. 185 (2), 495–508 (2008).

    Article  MATH  Google Scholar 

  41. J. Carlier, A. Moukrim, and H. Xu, “A memetic algorithm for the resource constrained project scheduling problem,” Proc. Int. Conf. Ind. Eng. Syst. Manage., IESM (2009).

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

    Article  MathSciNet  MATH  Google Scholar 

  43. M. Ranjbar and F. Kianfar, “A hybrid scatter search for the RCPSP,” Sci. Iran. 16 (1), 11–18 (2009).

    Google Scholar 

  44. P. Jedrzejowicz and E. Ratajczak, “Population learning algorithm for the resource-constrained project scheduling,” in Perspectives in Modern Project Scheduling, J. Jyzefowska and J. Weglarz (Eds.) (Springer, Boston, 2006), 275–296.

  45. K. C. Ying, S. W. Lin, and Z. J. Lee, “Hybrid-directional planning: improving improvement heuristics for scheduling resource-constrained projects,” Int. J. Adv. Manuf. Technol. 41 (3–4), 358–366 (2009).

    Article  Google Scholar 

  46. J. Alcaraz and C. Maroto, “A hybrid genetic algorithm based on intelligent encoding for project scheduling,” in Perspectives in Modern Project Scheduling, J. Jyzefowska and J. Weglarz (Eds.) (Springer, Boston, 2006) 249–274.

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

    Article  MATH  Google Scholar 

Download references

Funding

The study was carried out within the framework of the state contract of the Sobolev Institute of Mathematics, project no. FWNF–2022–0019.

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, 630090, Russia

    E. N. Goncharov

  2. Novosibirsk State University, Novosibirsk, 630090, Russia

    E. N. Goncharov

Authors
  1. E. N. Goncharov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to E. N. Goncharov.

Additional information

Translated by V. Potapchouck

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Goncharov, E.N. A Local Search Algorithm for the Resource-Constrained Project Scheduling Problem. J. Appl. Ind. Math. 16, 672–683 (2022). https://doi.org/10.1134/S1990478922040081

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1990478922040081

Keywords

Search

Navigation