Hybrid solution method for resource-constrained project scheduling problem using a new schedule generator

  • H. R. YoosefzadehEmail author
  • H. R. Tareghian


A number of exact scheduling schemes incorporating various solution procedures such as branch and bound and dynamic programming exist for solving the well-known resource-constrained project scheduling problem. In this paper, we report on an efficient hybrid method which prominently depends on a branch and bound with a look-ahead mechanism as well as a genetic algorithm coupled with a new schedule generation scheme called tri-directional schedule generator. Minimal delay set, core time, and left shift are among the pruning rules used to prune inferior nodes of the enumeration tree. The proposed method has been verified and validated using a standard set of test problems with 30–120 activities requiring between one and six resource types each. The capability and applicability of the proposed method are demonstrated using standard problem instances.


Project management Branch and bound Genetic algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blazewicz J, Lenstra J, Rinnoy Kan A (1983) Scheduling subject to resource constraints: classification and complexity. Discret Appl Math 5:11–24zbMATHCrossRefGoogle Scholar
  2. 2.
    Pritsker A, Watters L, Wolfe P (1969) Multi-project scheduling with limited resources: a zero-one programming approach. Manag Sci 16:93–107CrossRefGoogle Scholar
  3. 3.
    Petrovic R (1968) Optimization of resource allocation in project planning. Oper Res 16:559–586CrossRefGoogle Scholar
  4. 4.
    Patterson JH (1984) A comparison of exact procedures for solving the multiple constrained resource project scheduling problems. Manag Sci 30(7):854–867CrossRefGoogle Scholar
  5. 5.
    Icmeli O, Rom WO (1996) Solving resource constrained project scheduling problem with optimization subroutine library. Comput Oper Res 23:801–817zbMATHCrossRefGoogle Scholar
  6. 6.
    Stinson JP, Davis EW, Khumawala BH (1978) Multiple resource-constrained scheduling using branch and bound. AIIE Trans 10:252–259CrossRefGoogle Scholar
  7. 7.
    Demeulemeester E, Herroelen W (1992) A branch and bound procedure for the multiple resource-constrained project scheduling problem. Manag Sci 38:1803–1818zbMATHCrossRefGoogle Scholar
  8. 8.
    Mingozzi A, Maniezzo V, Ricciardelli S, Bianco L (1998) An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation. Manag Sci 44:714–729zbMATHCrossRefGoogle Scholar
  9. 9.
    Brucker P, Knust S, Schoo A, Thiele O (1998) A branch and bound algorithm for the resource-constrained project scheduling problem. Eur J Oper Res 107:272–288zbMATHCrossRefGoogle Scholar
  10. 10.
    Zamani MR (2001) A high-performance exact method for the resource-constrained project scheduling problem. Comput Oper Res 28:1387–1401MathSciNetzbMATHCrossRefGoogle Scholar
  11. 11.
    Jiang G, Shi J (2005) Exact algorithm for solving project scheduling problems under multi resource constrains. J Constr Eng Manag 131(9):986–992. doi: 10.1061/(ASCE)0733-9364 CrossRefGoogle Scholar
  12. 12.
    Brucker P, Drexl A, Mohring R, Neuman K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models and methods. Eur J Oper Res 112:3–41zbMATHCrossRefGoogle Scholar
  13. 13.
    Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resource-constrained project scheduling: an update. Eur J Oper Res 174:23–37zbMATHCrossRefGoogle Scholar
  14. 14.
    Christofides N, Alvarez-Valdez R, Tamarit JM (1987) Project scheduling with resource constraints: a branch and bound approach. Eur J Oper Res 29:262–273, North-HollandzbMATHCrossRefGoogle Scholar
  15. 15.
    Dorndorf U, Pesch E (1995) Evolution based learning in a job shop scheduling environment. Comput Oper Res 22:25–40zbMATHCrossRefGoogle Scholar
  16. 16.
    Yoosefzadeh HR, Tareghian HR, Farahi MH (2010) Tri-directional scheduling scheme: theory and computation. J Math Model Algorithm 9:357–373MathSciNetzbMATHCrossRefGoogle Scholar
  17. 17.
    Schrage L (1969) Solving resource constrained network problems with heuristic learning algorithms. J Oper Res 49(1):709–16Google Scholar
  18. 18.
    Klein R (2000) Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects. Eur J Oper Res 127:619–638zbMATHCrossRefGoogle Scholar
  19. 19.
    Kolisch, R., (2008) Library for project scheduling problems.

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  1. 1.Faculty of Mathematical SciencesFerdowsi University of MashhadMashhadIran

Personalised recommendations