Solving Project Scheduling Problems by Minimum Cut Computations

In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due to its universality, the latter problem has a variety of applications in manufacturing, production planning, project management, and elsewhere. It is one of the most intractable problems in operations research, and has therefore become a popular playground for the latest optimization techniques, including virtually all local search paradigms. We show that a somewhat more classical mathematical programming approach leads to both competitive feasible solutions and strong lower bounds, within reasonable computation times. The basic ingredients of our approach are the Lagrangian relaxation of a time-indexed integer programming formulation and relaxation-based list scheduling, enriched with a useful idea from recent approximation algorithms for machine scheduling problems. The efficiency of the algorithm results from the insight that the relaxed problem can be solved by computing a minimum cut in an appropriately defined directed graph. Our computational study covers different types of resource-constrained project scheduling problems, based on several notoriously hard test sets, including practical problem instances from chemical production planning.

[1]  R Eglese,et al.  Business Optimisation: Using mathematical programming , 1997, J. Oper. Res. Soc..

[2]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[3]  Jan Węglarz,et al.  Project scheduling : recent models, algorithms, and applications , 1999 .

[4]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[5]  J. Rhys.  A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .

[6]  J. E. Mitchell,et al.  Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem , 1994, IEEE Trans. Very Large Scale Integr. Syst..

[7]  Sönke Hartmann,et al.  Self-adapting genetic algorithms with an application to project scheduling , 1999 .

[8]  Rolf H. Möhring,et al.  Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time , 1984, Oper. Res..

[9]  Philip M. Wolfe,et al.  Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach , 1969 .

[10]  A. Kimms.  Lagrangean relaxation for scheduling projects under resource constraints to maximize the net present value , 1999 .

[11]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[12]  Erik Demeulemeester,et al.  Project network models with discounted cash flows a guided tour through recent developments , 1997, Eur. J. Oper. Res..

[13]  R. Kolisch,et al.  Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis , 1999 .

[14]  Marc Uetz.  Algorithms for Deterministic and Stochastic Scheduling , 2001 .

[15]  Alf Kimms,et al.  Maximizing the Net Present Value of a Project Under Resource Constraints Using a Lagrangian Relaxation Based Heuristic with Tight Upper Bounds , 2001, Ann. Oper. Res..

[16]  Peter Brucker,et al.  A linear programming and constraint propagation-based lower bound for the RCPSP , 2000, Eur. J. Oper. Res..

[17]  Toshihide Ibaraki,et al.  Formulation and Tabu Search Algorithm for the Resource Constrained Project Scheduling Problem , 2002 .

[18]  A. H. Russell.  Cash Flows in Networks , 1970 .

[19]  M. Balinski.  Notes—On a Selection Problem , 1970 .

[20]  Marshall L. Fisher,et al.  Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I , 1973, Oper. Res..

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

[22]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[23]  Martin Skutella,et al.  Single Machine Scheduling with Release Dates , 2002, SIAM J. Discret. Math..

[24]  Cynthia A. Phillips,et al.  Minimizing average completion time in the presence of release dates , 1998, Math. Program..

[25]  Zhi-Long Chen,et al.  Algorithms for deterministic and stochastic scheduling , 1997 .

[26]  David B. Shmoys,et al.  Scheduling to minimize average completion time: off-line and on-line algorithms , 1996, SODA '96.

[27]  M. Desu.  A Selection Problem , 1970 .

[28]  E. W. Davis,et al.  Multiple Resource–Constrained Scheduling Using Branch and Bound , 1978 .

[29]  Francisco Ballestín,et al.  A Population-Based Approach to the Resource-Constrained Project Scheduling Problem , 2004, Ann. Oper. Res..

[30]  Andreas S. Schulz,et al.  A Note on Scheduling Problems with Irregular Starting Time Costs , 2000 .

[31]  A. Prodon,et al.  Optimal subtrees and extensions , 1982 .

[32]  Rolf H. Möhring,et al.  On project scheduling with irregular starting time costs , 2001, Oper. Res. Lett..

[33]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[34]  Martin W. P. Savelsbergh,et al.  An experimental study of LP-based approximation algorithms for scheduling problems , 1998, SODA '98.

[35]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[36]  Robin O. Roundy,et al.  A Price-Directed Approach to Real-Time Scheduling of Production Operations , 1991 .

[37]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[38]  K. Bouleimen,et al.  A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version , 2003, Eur. J. Oper. Res..

[39]  Maurice Queyranne,et al.  Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems , 1998, IPCO.

[40]  M. D. Wilkinson,et al.  Management science , 1989, British Dental Journal.

[41]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[42]  Peter Brucker,et al.  A branch and bound algorithm for the resource-constrained project scheduling problem , 1998, Eur. J. Oper. Res..

[43]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[44]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

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

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

[47]  Christoph Schwindt,et al.  Generation of Resource-Constrained Project Scheduling Problems with Minimal and Maximal Time Lags , 1998 .

[48]  Cid C. de Souza,et al.  Scheduling under Labour Resource Constraints , 2004, Constraints.

[49]  David B. Shmoys,et al.  Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms , 1997, Math. Oper. Res..

[50]  Alf Kimms,et al.  Optimization guided lower and upper bounds for the resource investment problem , 2001, J. Oper. Res. Soc..

[51]  François Margot,et al.  The poset scheduling problem , 1989 .

[52]  Éva Tardos,et al.  A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

[53]  Celso C. Ribeiro,et al.  Parallel Cooperative Approaches for the Labor Constrained Scheduling Problem , 2002 .

[54]  Rajeev Motwani,et al.  Approximation techniques for average completion time scheduling , 1997, SODA '97.

[55]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[56]  A. J. Orman,et al.  On the Complexity of Coupled-task Scheduling , 1997, Discret. Appl. Math..

[57]  Laurence A. Wolsey,et al.  Scheduling projects with labor constraints , 2001, Discret. Appl. Math..

[58]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

[60]  Rolf H. Möhring,et al.  Resource-constrained project scheduling: Notation, classification, models, and methods , 1999, Eur. J. Oper. Res..

[61]  Vittorio Maniezzo,et al.  The project scheduling problem with irregular starting time costs , 1999, Oper. Res. Lett..

[62]  J. M. Tamarit,et al.  Project scheduling with resource constraints: A branch and bound approach , 1987 .

[63]  Erwin Pesch,et al.  A branch-and-bound algorithm for the resource-constrained project scheduling problem , 2000, Math. Methods Oper. Res..

[64]  Rainer Kolisch.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

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

[66]  Andrew V. Goldberg,et al.  On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.

[67]  Markus W. Schäffter,et al.  Scheduling with Forbidden Sets , 1997, Discret. Appl. Math..

[68]  V. Maniezzo,et al.  An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation , 1998 .

[69]  Christian Artigues,et al.  Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem , 2005, INFORMS J. Comput..

[70]  Sönke Hartmann,et al.  A competitive genetic algorithm for resource-constrained project scheduling , 1998 .

[71]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[72]  Uriel Feige,et al.  Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..

[73]  Andrew V. Goldberg,et al.  Beyond the flow decomposition barrier , 1998, JACM.

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

[75]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[76]  Richard C. Grinold,et al.  The payment scheduling problem , 1972 .

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

[78]  Sönke Hartmann,et al.  A self‐adapting genetic algorithm for project scheduling under resource constraints , 2002 .

[79]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .