A hybrid metaheuristic method for solving resource constrained project scheduling problem | Evolutionary Intelligence Skip to main content

Advertisement

Springer Nature Link
Log in

A hybrid metaheuristic method for solving resource constrained project scheduling problem

  • Research Paper
  • Published:
Evolutionary Intelligence Aims and scope Submit manuscript

Abstract

Resource constrained project scheduling problem (RCPSP) is a renowned variant of the scheduling problem. RCPSP is very important in production and management but computationally hard. It is widely used in many fields like job shop scheduling, flow shop scheduling, transactional planning, wireless communication etc. The objective of solving RCPSP is to obtain minimum makespan maintaining all constraints. There are some exact, approximate, heuristic and metaheuristic algorithms which were proposed to solve this problem. RCPSP is an NP-hard problem. Chemical reaction optimization (CRO) is a population based metaheuristic method to solve such problems and it shows better performance comparing with some other existing algorithms. CRO explores the large search space both locally and globally using its four operators. Genetic algorithm (GA) is also a nature inspired algorithm which is used to solve various optimization problems. In this paper, we are proposing a hybrid metaheuristic approach that integrates chemical reaction optimization (CRO) and genetic algorithm (GA) named CRO-GA to solve RCPSP. We have redesigned the basic operators of CRO and GA to find out the solutions. An additional operator called priority based selection operator is used in CRO to adjust with GA. Our proposed method is compared with other related approaches such as adaptive particle swarm optimization (A-PSO), multi agent optimization algorithm (MAOA), artificial bee colony (ABC), genetic algorithm (GA) which are state of the art for the RCPSP. The experimental results show that our proposed methodology gives better results than other existing algorithms to solve RCPSP with less computational time.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Akbari R, Zeighami V, Ziarati K (2011) Artificial bee colony for resource constrained project scheduling problem. Int J Ind Eng Comput 2(1):45–60

    Google Scholar 

  2. Baar T, Brucker P, Knust S (1999) Tabu search algorithms and lower bounds for the resource-constrained project scheduling problem. Meta-Heuristics. Springer, pp 1–18

  3. Barham R, Sharieh A, Sliet A (2016) Chemical reaction optimization for max flow problem. IJACSA). Int J Adv Comput Sci Appl 7(8)

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Boctor FF (1990) Some efficient multi-heuristic procedures for resource-constrained project scheduling. Eur J Operational Res 49(1):3–13

    Article  MATH  Google Scholar 

  6. Boctor FF (1996) Resource-constrained project scheduling by simulated annealing.Int J Prod Res 34(8):2335–2351

    Article  MATH  Google Scholar 

  7. Bouleimen K, Lecocq H (2003) A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur J Operational Res 149(2):268–281

    Article  MathSciNet  MATH  Google Scholar 

  8. Brooks GH (1969) An algorithm for finding optimal or near optimal solutions to the production scheduling problem. J Indl Eng 16(1):34–40

    Google Scholar 

  9. Demeulemeester EL, Herroelen WS (1996) An efficient optimal solution procedure for the preemptive resource-constrained project scheduling problem. Eur J Operational Res 90(2):334–348

    Article  MATH  Google Scholar 

  10. Drexl A, Gruenewald J (1993) Nonpreemptive multi-mode resource-constrained project scheduling. IIE Trans 25(5):74–81

    Article  Google Scholar 

  11. Garg H (2016) A hybrid pso-ga algorithm for constrained optimization problems. Appl Math Comput 274:292–305

    MathSciNet  MATH  Google Scholar 

  12. Herbots J, Herroelen W, Leus R (2004) Experimental investigation of the applicability of ant colony optimization algorithms for project scheduling

  13. Islam MR, Arif IH, Shuvo RH (2019) Generalized vertex cover using chemical reaction optimization. Appl Intell 1–21

  14. Islam MR, Saifullah CK, Asha ZT, Ahamed R (2018) Chemical reaction optimization for solving longest common subsequence problem for multiple string. Soft Comput 1–25

  15. Jarboui B, Damak N, Siarry P, Rebai A (2008) A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. Appl Math Comput 195(1):299–308

    MathSciNet  MATH  Google Scholar 

  16. Jia Q, Seo Y (2013) Solving resource-constrained project scheduling problems: conceptual validation of flp formulation and efficient permutation-based abc computation. Comput Operations Res 40(8):2037–2050

    Article  MathSciNet  MATH  Google Scholar 

  17. Kabir R, Islam R (2018) Chemical reaction optimization for rna structure prediction. Appl Intell 1–24

  18. Kelley JE (1963) The critical-path method: resource planning and scheduling. Ind Scheduling

  19. Kolisch R, Sprecher A (1997) Psplib-a project scheduling problem library: Or software-orsep operations research software exchange program. Eur J Operational Res 96(1):205–216

    Article  MATH  Google Scholar 

  20. Kumar N, Vidyarthi DP (2016) A model for resource-constrained project scheduling using adaptive pso. Soft Comput 20(4):1565–1580

    Article  Google Scholar 

  21. Lam AY, Li VO (2010) Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans Evolutionary Comput 14(3):381–399

    Article  Google Scholar 

  22. Mahmud MR, Pritom RM, Islam MR (2017) Optimization of collaborative transportation scheduling in supply chain management with tpl using chemical reaction optimization. In Computer and Information Technology (ICCIT), 2017 20th International Conference of, pages 1–6. IEEE

  23. Merkle D, Middendorf M, Schmeck H (2002) Ant colony optimization for resource-constrained project scheduling. IEEE Trans Evolutionary Comput 6(4):333–346

    Article  MATH  Google Scholar 

  24. Montoya-Torres JR, Gutierrez-Franco E, Pirachicán-Mayorga C (2010) Project scheduling with limited resources using a genetic algorithm. Int J Project Managt 28(6):619–628

    Article  Google Scholar 

  25. Nonobe K, Ibaraki T (2002) Formulation and tabu search algorithm for the resource constrained project scheduling problem. Essays and surveys in metaheuristics. Springer, pp 557–588

  26. Saifullah CK, Islam MR (2016) Chemical reaction optimization for solving shortest common supersequence problem. Comput Biolo Chem 64:82–93

    Article  Google Scholar 

  27. Truong TK, Li K, Xu Y (2013) Chemical reaction optimization with greedy strategy for the 0–1 knapsack problem. Appl Soft Comput 13(4):1774–1780

    Article  Google Scholar 

  28. Xu J, Lam AY, Li VO (2010) Parallel chemical reaction optimization for the quadratic assignment problem. In World Congress in Computer Science, Comput Eng Appl Comput, Worldcomp 2010

  29. Xu J, Lam AY, Li VO (2011) Chemical reaction optimization for task scheduling in grid computing. IEEE Trans Parallel Distributed Syst 22(10):1624–1631

    Article  Google Scholar 

  30. Zhang H, Li H, Tam C (2006) Particle swarm optimization for resource-constrained project scheduling. Int J Project Managt 24(1):83–92

    Article  Google Scholar 

  31. Zhang H, Li X, Li H, Huang F (2005) Particle swarm optimization-based schemes for resource-constrained project scheduling. Automation in Construc 14(3):393–404

    Article  Google Scholar 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science and Engineering Discipline, Khulna University, Khulna, 9208, Bangladesh

    Ohiduzzaman Shuvo, Swajan Golder & Md. Rafiqul Islam

Authors
  1. Ohiduzzaman Shuvo
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Swajan Golder
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Md. Rafiqul Islam
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Ohiduzzaman Shuvo.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shuvo, O., Golder, S. & Islam, M.R. A hybrid metaheuristic method for solving resource constrained project scheduling problem. Evol. Intel. 16, 519–537 (2023). https://doi.org/10.1007/s12065-021-00675-x

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12065-021-00675-x

Keywords