Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities

We study the problem of levelling resources in a project with generalized precedence relationships, given a deadline for the completion of all the activities and variable execution intensities and flexible durations of the activities. Variable execution intensities have been taken into account firstly by Kis (Math Program 103(3):515–539, 2005) applied to a real world scenario in which, due to the physical characteristics of some manufacturing processes, the effort associated with a certain activity for its execution may vary over time. Generalized precedence relationships and variable intensity execution and duration have not been dealt with together to the best of our knowledge. For this novel problem we propose a mixed-integer linear programming formulation, a lower bound based on Lagrangian relaxation, and a branch and bound algorithm. Computational results on known benchmarks are provided.

[1]  H. N. Ahuja.  Construction performance control by networks , 1976 .

[2]  Lucio Bianco,et al.  An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations , 2012, Eur. J. Oper. Res..

[3]  Christoph Schwindt,et al.  Handbook on project management and scheduling , 2015 .

[4]  Hartwig Nübel.  The resource renting problem subject to temporal constraints , 2001, OR Spectr..

[5]  Professor Dr. Klaus Neumann,et al.  Project Scheduling with Time Windows and Scarce Resources , 2003, Springer Berlin Heidelberg.

[6]  Julia Rieck,et al.  The total adjustment cost problem: Applications, models, and solution algorithms , 2014, J. Sched..

[7]  Julia Rieck,et al.  Mixed-integer linear programming for resource leveling problems , 2012, Eur. J. Oper. Res..

[8]  Said M. Easa,et al.  Resource Leveling in Construction by Optimization , 1989 .

[9]  N. Trautmann,et al.  A priority-rule method for project scheduling with work-content constraints , 2010, Eur. J. Oper. Res..

[10]  Rolf H. Möhring,et al.  Scheduling project networks with resource constraints and time windows , 1988 .

[11]  Eugene W. Myers,et al.  Finding All Spanning Trees of Directed and Undirected Graphs , 1978, SIAM J. Comput..

[12]  Jürgen Zimmermann,et al.  Exact methods for the resource levelling problem , 2011, J. Sched..

[13]  Jürgen Zimmermann,et al.  Handbook on Project Management and Scheduling Vol.1 , 2015 .

[14]  Julia Rieck,et al.  Exact Methods for Resource Leveling Problems , 2015 .

[15]  Lucio Bianco,et al.  Minimizing the completion time of a project under resource constraints and feeding precedence relations: a Lagrangian relaxation based lower bound , 2011, 4OR.

[16]  Tamás Kis,et al.  A branch-and-cut algorithm for scheduling of projects with variable-intensity activities , 2005, Math. Program..

[17]  Rainer Kolisch,et al.  Benchmark instances for project scheduling problems , 1999 .