Journal of Scheduling

, Volume 14, Issue 6, pp 557–569 | Cite as

Exact methods for the resource levelling problem

  • Thorsten GatherEmail author
  • Jürgen Zimmermann
  • Jan-Hendrik Bartels


We present a project scheduling problem subject to general temporal constraints where the utilization of a set of renewable resources has to be smoothed over time. For solving the NP-hard optimization problem, we point out some important structural properties and introduce a new enumeration scheme. Combining this enumeration scheme with some branch-and-bound techniques, we propose an appropriate solution procedure for the project scheduling problem at hand. To outline the practical importance of resource levelling, we sketch exemplary the optimization of mid-term planning schedules with regard to the resource requirements of IT projects. Finally, we present results from a comprehensive computational study on problem instances of the well-known rlp_j10 and rlp_j20 test sets devised by Kolisch et al. (Benchmark Instances for Project Scheduling Problems, Kluwer, Boston, 1999).


Resource levelling Renewable resources Project scheduling Enumeration Branch-and-bound 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Ahuja, H. (1976). Construction performance control by networks. New York: John Wiley and Sons. Google Scholar
  2. Ahuja, R., Magnanti, T., & Orlin, J. (1993). Network flows. Englewood Cliffs: Prentice Hall. Google Scholar
  3. Ballestin, F., Schwindt, C., & Zimmermann, J. (2007). Resource leveling in make-to-order production: modeling and heuristic solution method. International Journal of Operations Research, 4, 50–62. Google Scholar
  4. Bandelloni, M., Tucci, M., & Rinaldi, R. (1994). Optimal resource leveling using non-serial dynamic programming. European Journal of Operations Research, 78, 162–178. CrossRefGoogle Scholar
  5. Burgess, A., & Killebrew, J. (1962). Variation in activity level on a cyclical arrow diagram. Journal of Industrial Engineering, 13(2), 76–83. Google Scholar
  6. Easa, S. (1989). Resource leveling in construction by optimization. Journal of Construction Engineering and Management, 115(2), 302–316. CrossRefGoogle Scholar
  7. Engelhardt, H., & Zimmermann, J. (1998). Lower bounds and exact methods for resource levelling problems. Report WIOR 517, University of Karlsruhe. Google Scholar
  8. Franck, B., Neumann, K., & Schwindt, C. (2001). Truncated branch-and-bound, schedule construction, and schedule improvement procedures for resource-constrained project scheduling. OR Spektrum, 23, 297–324. CrossRefGoogle Scholar
  9. Gabow, H., & Myers, E. (1978). Finding all spanning trees of directed and undirected graphs. SIAM Journal on Computing, 7, 280–287. CrossRefGoogle Scholar
  10. Galbreath, R. (1965). Computer program for leveling resource usage. Journal of the Construction Division, 91(1), 107–124. Google Scholar
  11. Harris, R. (1978). Precedence and arrow networks for construction. New York: John Wiley and Sons. Google Scholar
  12. Harris, R. (1990). Packing method for resource leveling (pack). Journal of Construction Engineering and Management, 116, 39–43. CrossRefGoogle Scholar
  13. Kolisch, R., Schwindt, C., & Sprecher, A. (1999). Benchmark instances for project scheduling problems. In J. Węglarz (Ed.), Project scheduling: recent models, algorithms and applications. Boston: Kluwer Academic. Google Scholar
  14. Neumann, K., & Zimmermann, J. (2000). Procedures for resource levelling and net present value problems in project scheduling with general temporal and resource constraints. European Journal of Operations Research, 127, 425–443. CrossRefGoogle Scholar
  15. Neumann, K., Nübel, H., & Schwindt, C. (2000). Active and stable project scheduling. Mathematical Methods of Operations Research, 52, 441–465. CrossRefGoogle Scholar
  16. Neumann, K., Schwindt, C., & Zimmermann, J. (2003). Project scheduling with time windows and scarce resources. Berlin: Springer. Google Scholar
  17. Nübel, H. (1999). Minimierung der Ressourcenkosten für Projekte mit planungsabhängigen Zeitfenstern. Wiesbaden: Gabler. Google Scholar
  18. Nübel, H. (2001). The resource renting problem subject to temporal constraints. OR Spektrum, 23, 359–381. CrossRefGoogle Scholar
  19. Petrovic, R. (1969). On optimization of resource leveling in project plans. In H. J. Lombaers (Ed.), Project planning by network analysis: proceedings of the 2nd international congress (pp. 268–273). Amsterdam: North-Holland. Google Scholar
  20. Roy, B. (1964). Les problemes d ordonnancement. Paris: Dunod. Google Scholar
  21. Wiest, J., & Levy, F. (1977). A management guide to PERT/CPM. Englewood Cliffs: Prentice Hall. Google Scholar
  22. Zimmermann, J. (2001). Ablauforientiertes Projektmanagement: Modelle, Verfahren und Anwendungen. Wiesbaden: Gabler. Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Thorsten Gather
    • 1
    Email author
  • Jürgen Zimmermann
    • 1
  • Jan-Hendrik Bartels
    • 1
  1. 1.Institute of Management and EconomicsClausthal University of TechnologyClausthal-ZellerfeldGermany

Personalised recommendations