Lower bounds for resource-constrained project scheduling problems

European Journal of Operational Research

Volumn 149, Issue 2, 2003, Pages 302-313

  Brucker, Peter ^a   Knust, Sigrid ^a  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

Author keywords

Column generation; Constraint propagation; Lower bounds; Multi mode; Resource constrained project scheduling problem; Scheduling

Indexed keywords

BOUNDARY CONDITIONS; CONSTRAINT THEORY; LINEAR PROGRAMMING; RESOURCE ALLOCATION; SCHEDULING; THRESHOLD LOGIC;

CONSTRAINT PROPAGATION;

PROJECT MANAGEMENT;

EID: 0038183863     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00762-2     Document Type: Conference Paper

References (27)

1. Bartusch M., Möhring R.H., Radermacher F.J. Scheduling project networks with resource constraints and time windows. Annals of Operations Research. 16:1988;201-240.
2. Boctor F.F. A new and efficient heuristic for scheduling problems with resource restrictions and multiple execution modes. European Journal of Operational Research. 90:1996;349-361.
3. K. Bouleimen, H. Lecoque, A new efficient simulated annealing algorithm for the resource constrained project scheduling problem and its multiple mode version, Technical Report, University of Liege, 1998.
4. Brucker P., Drexl A., Möhring R.H., Neumann K., Pesch E. Resource-constrained project scheduling: notation, classification, models and methods. European Journal of Operational Research. 112:1999;3-14.
5. Brucker P., Knust S., Schoo A., Thiele O. A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research. 107:1998;272-288.
6. Brucker P., Knust S. A linear programming and constraint propagation-based lower bound for the RCPSP. European Journal of Operational Research. 127:2000;355-362.
7. P. Brucker, S. Knust, Resource-constrained project scheduling and timetabling, in: E. Burke, W. Erben (Eds.), The Practice and Theory of Automated Timetabling III, Springer Lecture Notes in Computer Science, vol. 2079, 2001.
8. De Reyck B., Herroelen W. A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research. 111:1998;152-174.
9. De Reyck B., Herroelen W. The multi-mode resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research. 119:1999;538-556.
10. Dorndorf U., Pesch E., Phan-Huy T. A time-oriented branch-and-bound algorithm for project scheduling with generalised precedence constraints. Management Science. 46:2000;1365-1384.
11. A. Fest, R.H. Möhring, F. Stork, M. Uetz, Resource-constrained project scheduling with time windows: A branching scheme based on dynamic release dates, Technical Report 596, Technische Universität Berlin, 1998.
12. B. Franck, Prioritätsregelverfahren für die ressourcenbeschränkte Projektplanung mit und ohne Kalender, Dissertation, Shaker, Aachen, 1999.
13. Hartmann S., Drexl A. Project scheduling with multiple modes: a comparison of exact algorithms. Networks. 32:1998;283-297.
14. R. Heilmann, Ressourcenbeschränkte Projektplanung im Mehr-Modus-Fall, Dissertation, Deutscher Universitätsverlag, Wiesbaden, 2000.
15. R. Heilmann, C. Schwindt, Lower Bounds for RCPSP/max, Report WIOR-511, Universität Karlsruhe, 1997.
16. W. Herroelen, E. Demeulemeester, B. De Reyck, A classification scheme for project scheduling, in: J. Wȩglarz (Ed.), Handbook on Recent Advances in Project Scheduling, Kluwer, 1998, pp. 197-212.
17. Klein R., Scholl A. Computing lower bounds by destructive improvement - an application to resource-constrained project scheduling. European Journal of Operational Research. 112:1999;322-346.
18. Kolisch R. Project Scheduling under Resource Constraints: Efficient Heuristics for Several Problem Classes. 1995;Physica, Heidelberg.
19. Kolisch R., Schwindt C., Sprecher A. Benchmark instances for project scheduling problems. Wȩglarz J. Handbook on Recent Advances in Project Scheduling. 1998;197-212 Kluwer.
20. Maniezzo V., Mingozzi A. A heuristic for the multi-mode project scheduling problem based on Bender's decomposition. Wȩglarz J. Handbook on Recent Advances in Project Scheduling. 1998;179-196 Kluwer.
21. Mingozzi A., Maniezzo V., Ricciardelli S., Bianco L. An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation. Management Science. 44:1998;714-729.
22. R.H. Möhring, A.S. Schulz, F. Stork, M. Uetz, Resource-constrained project scheduling: Computing lower bounds by solving minimum cut problems, in: J. Nesetril (Ed.), Proceedings of the 7th Annual European Symposium on Algorithms, Lecture Notes in Computer Science 1643, Springer, 1999, pp. 139-150.
23. Nonobe K., Ibaraki T. Formulation and tabu search algorithm for the resource constrained project scheduling problem. Ribeiro C.C., Hansen P. Essays and Surveys in Metaheuristics. 2002;557-588 Kluwer.
24. PSPLIB - Project Scheduling Problem Library Kiel http://www.bwl.uni-kiel.de/Prod/psplib/.
25. PSPLIB/max - Project Scheduling Problem Library Karlsruhe http://www.wior.uni-karlsruhe.de/RCPSPmax/progenmax/.
26. C. Schwindt, Verfahren zur Lösung des ressourcenbeschränkten Projektdauerminimierungsproblems mit planungsabhängigen Zeitfenstern, Dissertation, Shaker, Aachen, 1998.
27. Sprecher A., Drexl A. Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. European Journal of Operational Research. 107:1998;431-450.