Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1643, Issue , 1999, Pages 139-150

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

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIRECTED GRAPHS; LAGRANGE MULTIPLIERS; POLYNOMIAL APPROXIMATION; SCHEDULING;

COMPUTATIONAL STUDIES; LA-GRANGIAN APPROACHES; OBJECTIVE FUNCTION VALUES; POLYNOMIAL-TIME ALGORITHMS; PROJECT SCHEDULING; RESOURCE CONSTRAINED PROJECT SCHEDULING; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; TEMPORAL CONSTRAINTS;

PROBLEM SOLVING;

EID: 84958062698     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_13     Document Type: Conference Paper

References (21)

1. M. Bartusch, R. H. Möhring, and F. J. Radermacher. Scheduling project networks with resource constraints and time windows. Annals of Operations Research, 16:201–240, 1988.
2. P. Brucker, A. Drexl, R. H. Möhring, K. Neumann, and E. Pesch. Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 112:3–41, 1999.
3. P. Brucker and S. Knust. Alinear programming and constraint propagation-based lower bound for the RCPSP. Technical Report 204, Osnabr¨ucker Schriften zur Mathematik, 1998.
4. C. C. B. Cavalcante, C. C. De Souza, M. W. P. Savelsbergh, Y. Wang, and L. A. Wolsey. Scheduling projects with labor constraints. CORE Discussion Paper 9859, Universite Catholique de Louvain, Louvain-la-Neuve, Belgium, 1998.
5. S. Chaudhuri, R. A. Walker, and J. E. Mitchell. Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2:456–471, 1994.
6. B. Cherkassky and A. V. Goldberg. On implementing push-relabel method for the maximum flow problem. In Proceedings of the 4th Conference on Integer Programming and Combinatorial Optimization, pages 157–171, 1995.
7. N. Christofides, R. Alvarez-Valdes, and J. Tamarit. Project scheduling with resource constraints: A branch-and-bound approach. European Journal of Operational Research, 29:262–273, 1987.
8. A. Drexl and A. Kimms. Optimization guided lower and upper bounds for the Resource Investment Problem. Technical Report 481, Manuskripte aus den Instituten f¨ur Betriebswirtschaftslehre der Universität Kiel, 1998.
9. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. Journal of the ACM, 35:921–940, 1988.
10. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, NewYork, 1980.
11. http://www.dcc.unicamp.br/˜cris/SPLC.html.
12. J. Kallrath and J. M. Wilson. Business Optimisation using Mathematical Programming. Macmillan Business, London, U.K., 1997.
13. R. Kolisch and A. Sprecher. PSPLIB - a project scheduling problem library. European Journal of Operational Research, 96:205–216, 1996.
14. A. Mingozzi, V. Maniezzo, S. Ricciardelli, and L. Bianco. An exact algorithm for the multiple resource-constraint project scheduling problem based on a new mathematical formulation. Management Science, 44:714–729, 1998.
15. R. H. Möhring. Minimizing costs of resource requirements subject to a fixed completion time in project networks. Operations Research, 32:89–120, 1984.
16. R. H. Möhring. Algorithmic aspects of comparability graphs and interval graphs. In I. Rival, editor, Graphs and Order, pages 41–101. D. Reidel Publishing Company, Dordrecht, 1985.
17. R. H. Möhring, A. S. Schulz, F. Sork, and M. Uetz. In preparation, 1999.
18. A. A. B. Pritsker, L. J. Watters, and P. M. Wolfe. Multi project scheduling with limited resources: A zero-one programming approach. Management Science, 16:93–108, 1969.
19. M.W. P. Savelsbergh, R. N. Uma, and J. Wein. An experimental study of LP-based approximation algorithms for scheduling problems. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 453–462, 1998.
20. M. Schäffter. Scheduling with respect to forbidden sets. Discrete Applied Mathematics, 72:141–154, 1997.
21. C. Schwindt. Generation of resource constrained project scheduling problems with minimal and maximal time lags. Technical Report 489, WIOR, University of Karlsruhe, Germany, 1996.