Solving project scheduling problems by minimum cut computations

Management Science

Volumn 49, Issue 3, 2003, Pages 330-350

  Möhring, Rolf H ^a   Schulz, Andreas S ^b   Stork, Frederik ^c   Uetz, Marc ^d  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c ILOG Deutschland GmbH   (Germany)

^d MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Lagrangian Relaxation; Linear Programming Relaxation; Minimum Cut; Project Scheduling; Resource Constraints

Indexed keywords

COMPUTATIONAL METHODS; PLANNING; PROBLEM SOLVING; SCHEDULING; SOCIETIES AND INSTITUTIONS;

PROJECT SCHEDULING;

PROJECT MANAGEMENT;

EID: 0037871958     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.49.3.330.12737     Document Type: Article

References (65)

1. Balinski, M. 1970. On a selection problem. Management Sci. 17 230-231.
2. Bellman, R. 1958. On a routing problem. Quart. Appl. Math. 16 87-90.
3. Bertsekas, D. P. 1999. Nonlinear Programming, 2nd ed. Athena Scientific, Belmont, MA.
4. Blazewicz, J., J. K. Lenstra, A. H. G. Rimooy Kan. 1983. Scheduling subject to resource constraints: Classification and complexity. Discrete Appl. Math. 5 11-24.
5. Bouleimen, K., H. Lecocq. 2002. A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple modes version. Eur. J. Oper. Res. Forthcoming.
6. Brucker, P., A. Drexl, R. H. Möhring, K. Neumann, E. Pesch. 1999. Resource-constrained project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. 112 3-41.
7. _, S. Knust. 2000. A linear programming and constraint propagation-based lower bound for the RCPSP. Eur. J. Oper. Res. 127 353-562.
8. Camerini, P. M., L. Fratta, F. Maffioli. 1975. On improving relaxation methods by modified gradient techniques. Math. Programming Stud. 3 26-34.
9. Cavalcante, C. C. B., C. C. de Souza. 1997. A tabu search approach for scheduling problems under labour constraints. Technical report IC-97-13, Instituto de Computação, UNICAMP, Campinas, Brazil.
10. _, V. C. Cavalcante, C. C. Ribeiro, C. C. de Souza. 2001a. Parallel cooperative approaches for the labor constrained scheduling problem. C. C. Ribeiro, P. Hansen, eds. Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, Dordrecht, The Netherlands, 201-226.
11. _, C. C. de Souza, M. W. P. Savelsbergh, Y. Wang, L. A. Wolsey. 2001b. Scheduling projects with labor constraints. Discrete Appl. Math. 112 27-52.
12. Chang, G., J. Edmonds. 1985. The poset scheduling problem. Order 2 113-118.
13. Chaudhuri, S., R. A. Walker, J. E. Mitchell. 1994. Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem. IEEE Trans. Very Large Scale Integration (VLSI) Systems 2 456-471.
14. Chekuri, C., R. Motwani, B. Natarajan, C. Stein. 2001. Approximation techniques for average completion time scheduling. SIAM J. Comput. 31 146-166.
15. Cherkassky, B. V., A. V. Goldberg. 1997. On implementing the push-relabel method for the maximum flow problem. Algorithmica 19 390-410.
16. Christofides, N., R. Alvarez-Valdés, J. M. Tamarit. 1987. Project scheduling with resource constraints: A branch and bound approach. Eur. J. Oper. Res. 29 262-273.
17. Demassey, S., C. Artigues, P. Michelon. 2001a. Comparing lower bounds for the RCPSP under a hybrid constraint-linear programming approach. Proc. Workshop Cooperative Solvers Constraint Programming. Paphos, Cyprus, 109-123.
18. _, _, _. 2001b. Constraint propagation based cutting planes: An application to the resource-constrained project scheduling problem. Technical report 237, Laboratoire d'Informatique d'Avignon, Avignon, France.
19. Dorndorf, U., E. Pesch, T. Phan Huy. 2000a. A branch-and-bound algorithm for the resource-constrained project scheduling problem. Math. Methods Oper. Res. 52 413-439.
20. _, _, _. 2000b. A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalized precedence constraints. Management Sci. 46 1365-1384.
21. Drexl, A., A. Kimms. 2001. Optimization guided lower and upper bounds for the resource investment problem. J. Oper. Res. Soc. 52 340-351.
22. Everett, H., III. 1963. Generalized Lagrange multiplier method for solving problems of optimum allocation of resources. Oper. Res. 11 399-417.
23. Feige, U., J. Kilian. 1998. Zero-knowledge and the chromatic number. J. Comput. System Sci. 57 187-199.
24. Fest, A., R. H. Möhring, F. Stork, M. Uetz. 1998. Resource constrained project scheduling with time windows: A branching scheme based on dynamic release dates. Technical report 596/1998 (revised 1999), Institut für Mathematik, Technische Universität Berlin, Berlin, Germany.
25. Goemans, M. X., M. Queyranne, A. S. Schulz, M. Skutella, Y. Wang. 2002. Single machine scheduling with release dates. SIAM J. Discrete Math. 15 165-192.
26. Goldberg, A. V., S. Rao. 1998. Beyond the flow decomposition barrier. J. Assoc. Comput. Mach. 45 783-797.
27. _, R. E. Tarjan. 1988. A new approach to the maximum-flow problem. J. Assoc. Comput. Mach. 35 921-940.
28. Graham, R. L. 1966. Bounds for certain multiprocessing anomalies. Bell System Tech. J. 45 1563-1581.
29. Grinold, R. C. 1972. The payment scheduling problem. Naval Res. Logist. Quart. 19 123-136.
30. Gröflin, H., T. M. Liebling, A. Prodon. 1982. Optimal subtrees and extensions. Ann. Discrete Math. 16 121-127.
31. Hall, L. A., A. S. Schulz, D. B. Shmoys, J. Wein. 1997. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Oper. Res. 22 513-544.
32. Hartmann, S. 1998. A competitive genetic algorithm for resource-constrained project scheduling. Naval Res. Logist. 45 733-750.
33. _. 2002. A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Res. Logist. 49 433-448.
34. Heilmann, R., C. Schwindt. 1997. Lower bounds for RCPSP/max. Technical report 511, WIOR, Universität Karlsruhe, Karlsruhe, Germany.
35. Heipcke, S. 1999. Combined modelling and problem solving in mathematical programming and constraint programming. Ph.D. thesis, University of Buckingham, Buckingham, U.K.
36. _, Y. Colombani, C. C. B. Cavalcante, C. C. de Souza. 2000. Scheduling under labour resource constraints. Constraints 5 415-422.
37. Kallrath, J., J. M. Wilson. 1997. Business Optimisation Using Mathematical Programming. Macmillan Business, London U.K.
38. Kimms, A. 2001. Maximizing the net present value of a project under resource constraints using a Lagrangian relaxation based heuristic with tight upper bounds. Ann. Oper. Res. 102 221-236.
39. Klein, R., A. Scholl. 1999. Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling, Eur. J. Oper. Res. 112 322-346.
40. Kolisch, R. 1996. Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. Eur. J. Oper. Res. 90 320-333.
41. _, S. Hartmann. 1999. Heuristic algorithms for the resource-constrained project scheduling problem: Classification and computational analysis. J. Wȩglarz, ed. Project Scheduling: Recent Models, Algorithms and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands, 147-178.
42. _, A. Sprecher. 1996. PSPLIB - A project scheduling problem library. Eur. J. Oper. Res. 96 205-216.
43. _, C. Schwindt, A. Sprecher. 1999. Benchmark instances for project scheduling problems. J. Wȩglarz, ed. Project Scheduling: Recent Models, Algorithms and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands, 197-212.
44. Merkle, D., M. Middendorf, H. Schmeck. 2000. Ant colony optimization for resource-constrained project scheduling. Proc. Genetic Evolutionary Comput. Conf., Las Vegas, NV, 893-900.
45. Mingozzi, A., V. Maniezzo, S. Ricciardelli, L. Bianco. 1998. An exact algorithm for the multiple resource constained project scheduling problem based on a new mathematical formulation. Management Sci. 44 714-729.
46. Möhring, R. H. 1984. Minimizing costs of resource requirements subject to a fixed completion time in project networks. Oper. Res. 32 89-120.
47. _, A. S. Schulz, F. Stork, M. Uetz. 1999. Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems. J. Nešetřil, ed. Proc. 7th Ann. Eur. Sympos. Algorithms. Prague, Czech Republic, Lecture Notes in Comput. Sci. Vol. 1643. Springer-Verlag, Berlin, Germany, 139-150.
48. _, _, _, _. 2001. On project scheduling with irregular starting time costs. Oper. Res. Lett. 28 149-154.
49. Nonobe, K., T. Ibaraki. 2001. Formulation and tabu search algorithm for the resource constrained project scheduling problem. C. C. Ribeiro, P. Hansen, eds. Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, Dordrecht, The Netherlands, 557-588.
50. Phillips, C. A., C. Stein, J. Wein. 1998. Minimizing average completion time in the presence of release dates. Math. Programming 82 199-223.
51. Pritsker, A. A. B., L. J. Watters, P. M. Wolfe. 1969. Multi-project scheduling with limited resources: A zero-one programming approach. Management Sci. 16 93-108.
52. PSPLIB. 2000. ftp://ftp.bwl.uni-kiel.de/pub/operations-research/psplib/HTML/index.html.
53. PSPLIB/max. 2000.http://www.wior.uni-karlsruhe.de/LS_Neumann/Forschung/ProGenMax/.
54. Queyranne, M., A. S. Schulz. 2003. Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. SIAM J. Comput. Forthcoming.
55. Rhys, J. M. W. 1970. A selection problem of shared fixed costs and network flows. Management Sci. 17 200-207.
56. Roundy, R. O., W. L. Maxwell, Y. T. Herer, S. R. Tayur, A. W. Getzler. 1991. A price-directed approach to real-time scheduling of product operations. IIE Trans. 23 149-160.
57. Sankaran, J. K., D. L. Bricker, S.-H. Juang. 1999. A strong fractional cutting-plane algorithm for resource-constrained project scheduling. Internat. J. Indust. Engrg. 6 99-111.
58. Savelsbergh, M. W. P., R. N. Uma, J. Wein. 1998. An experimental study of LP-based approximation algorithms for scheduling problems. Proc. Ninth Ann. ACM-SIAM Sympos. Discrete Algorithms. San Francisco, CA, 453-462.
59. Schafter. M. 1997. Scheduling with respect to forbidden sets. Discrete Appl. Math. 72 141-154.
60. Schwindt, C. 1996. Generation of resource constrained project scheduling problems with minimal and maximal time lags. Technical report 489, WIOR, Universität Karlsruhe, Karlsruhe, Germany.
61. _. 1998. A branch-and-bound algorithm for the resource-constrained project duration problem subject to temporal constraints. Technical report 544, WIOR, Universität Karlsruhe, Karlsruhe, Germany.
62. Selle, T. 1999. Lower bounds for project scheduling problems with renewable and cumulative resources. Technical report 573, WIOR, Universität Karlsruhe, Karlsruhe, Germany.
63. Uetz, M. 2001. Algorithms for deterministic and stochastic scheduling. Ph.D. thesis, Institut für Mathematik, Technische Universität Berlin, Berlin, Germany. Published by Cuvillier Verlag, Göttingen, Germany.
64. Valls, V., F. Ballestín, S. Quintanilla. 2001. A population-based approach to the resource-constrained project scheduling problem. Technical report 10-2001, Departamento de Estadística e Investigación Operativa, Universität de València, Spain.
65. Wȩglarz, J., ed. 1999. Project Scheduling: Recent Models, Algorithms, and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands.