An exact algorithm to minimize the makespan in project scheduling with scarce resources and generalized precedence relations

In this paper we propose an exact algorithm for the Resource Constrained Project Scheduling Problem (RCPSP) with generalized precedence relationships (GPRs) and minimum makespan objective. For the RCPSP with GPRs we give a new mathematical formulation and a branch and bound algorithm exploiting such a formulation. The exact algorithm takes advantage also of a lower bound based on a Lagrangian relaxation of the same mathematical formulation. We provide an extensive experimentation and a comparison with known lower bounds and competing exact algorithms drawn from the state of the art.

[1]  Lucio Bianco,et al.  A new formulation of the resource‐unconstrained project scheduling problem with generalized precedence relations to minimize the completion time , 2010, Networks.

[2]  Ulrich Dorndorf,et al.  Project Scheduling with Time Windows: From Theory to Applications , 2002 .

[3]  Erik Demeulemeester,et al.  New Benchmark Results for the Resource-Constrained Project Scheduling Problem , 1997 .

[4]  Rolf H. Möhring,et al.  Resource constrained project scheduling with time windows: a branching scheme based on dynamic release dates (Technical Report 596-1998) , 1998 .

[5]  Lucio Bianco,et al.  A new lower bound for the resource-constrained project scheduling problem with generalized precedence relations , 2011, Comput. Oper. Res..

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

[7]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[8]  Bert De Reyck,et al.  A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations , 1998, Eur. J. Oper. Res..

[9]  Ulrich Dorndorf,et al.  Project Scheduling with Time Windows , 2002 .

[10]  Armin Scholl,et al.  Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling , 1999, Eur. J. Oper. Res..

[11]  Rainer Kolisch,et al.  Characterization and generation of a general class of resource-constrained project scheduling problems , 1995 .

[12]  Rolf H. Möhring,et al.  Solving Project Scheduling Problems by Minimum Cut Computations , 2002, Manag. Sci..

[13]  Erik Demeulemeester,et al.  Project scheduling : a research handbook , 2002 .

[14]  U. Dorndorf,et al.  A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints , 2000 .

[15]  Erik Demeulemeester,et al.  A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem , 1997, Oper. Res..

[16]  Rolf H. Möhring,et al.  Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems , 1999, ESA.

[17]  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.

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