New Challenges in Scheduling Theory

September, 12-17 2010, Centre CNRS "La Villa Clythia", Frejus

Exact methods for resource levelling problems

SpeakerJuergen Zimmermann

We present exact solution methods for resource levelling problems with minimum and maximum time lags among the project activities. In particular, we consider a time-window based enumeration method and two tree-based branch-and-bound procedures both with a sophisticated constructive lower bound. Furthermore, we propose a mixed integer linear programming formulation that can be solved by standard solvers such as CPLEX. All approaches a compared in a comprehensive computational study using well-known test sets from literature. Instances with up to 50 activities could be solved to optimality