Abstract
The problem of scheduling projects under various types of resource constraints constitutes an important and challenging problem which has received increasing attention during the past several years. The bulk of the models and procedures designed for coping with these problem types aim at scheduling project activities to minimize the project duration subject to constant availability constraints on the required set of resources and precedence constraints that indicate that activities can only be started when all of their predecessors have already been finished. However, real-life project scheduling applications often involve more complicated types of precedence relations such as arbitrary minimal and maximal time lags between the starting and completion times of the activities, and require more sophisticated regular and nonregular objective functions. Over the past few years, considerable progress has been made in the use of exact solution procedures for this problem type and its variants. We will review the fundamental logic and report new computational experience with solution procedures for optimally solving resource-constrained project scheduling problems in which such generalized precedence relations and objective functions can be explicitly considered.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bartusch, M., R. H. Möhring, and F. J. Radermacher. 1988. Scheduling Project Networks with Resource Constraints and Time Windows. Annals O.R. 16, 201–240.
Brinkmann, K. and K. Neumann. 1996. Heuristic Procedures for Resource-Constrained Project Scheduling with Minimal and Maximal Time Lags: The Minimum Project-Duration and Resource-Levelling Problem. J. Dec. Syst. 5, 129–156.
Cooper, D. F. 1976. Heuristics for Scheduling Resource-Constrained Projects: An Experimental Comparison. Mgmt. Sci. 22, 1186–1194.
Crandall, K. C. 1973. Project Planning with Precedence Lead / Lag Factors. Project Mgmt. Quart. 4, 18–27.
De Reyck, B. 1995. On the Use of the Restrictiveness as a Measure of Complexity for Resource-Constrained Project Scheduling. Research Report 9535, Department of Applied Economics, Katholieke Universiteit Leuven.
De Reyck, B. 1998. Scheduling Projects with Generalized Precedence Relations-Exact and Heuristic Procedures. Ph.D. Dissertation, Department of Applied Economics, Katholieke Universiteit Leuven.
De Reyck, B. and W. Herroelen. 1996a. On the Use of the Complexity Index as a Measure of Complexity in Activity Networks, Eur. J. Opnl. Res. 91, 347–366.
De Reyck, B. and W. Herroelen. 1996b. An Optimal Procedure for the Unconstrained Max-npv Project Scheduling Problem with Generalized Precedence Relations. Research Report 9642, Department of Applied Economics, Katholieke Universiteit Leuven.
De Reyck, B. and W. Herroelen. 1997. The Multi-Mode Resource-Constrained Project Scheduling Problem with Generalized Precedence Relations. Research Report 9725, Department of Applied Economics, Katholieke Universiteit Leuven.
De Reyck, B. and W. Herroelen. 1998a. A Branch-and-Bound Algorithm for the Resource-Constrained Project Scheduling Problem with Generalized Precedence Relations, Eur. J. Opnl. Res., to appear.
De Reyck, B. and W. Herroelen. 1998b. An Optimal Procedure for the Resource-Constrained Project Scheduling Problem with Discounted Cash Flows and Generalized Precedence Relations, Comput. and O.R. 25, 1–17.
Demeulemeester, E. and W. Herroelen. 1992. A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem. Mgmt. Sci. 38, 1803–1818.
Demeulemeester, E. and W. Herroelen. 1997a. New Benchmark Results for the Resource-Constrained Project Scheduling Problem. Mgmt. Sci. 43, 1485–1492.
Demeulemeester, E. and W. Herroelen. 1997b. A Branch-and-Bound Procedure for the Generalized Resource-Constrained Project Scheduling Problem. Opns. Res. 45, 201–212.
Elmaghraby, S. E. 1977. Activity Networks — Project Planning and Control by Network Models. Wiley Interscience, New York.
Elmaghraby, S. E. and W. Herroelen. 1980. On the Measurement of Complexity in Activity Networks, Eur. J. Opnl. Res. 5, 223–234.
Elmaghraby, S. E. and W. Herroelen. 1990. The Scheduling of Activities to Maximize the Net Present Value of Projects. Eur. J. Opnl. Res. 49, 35–49.
Elmaghraby, S. E. and J. Kamburowski. 1992. The Analysis of Activity Networks under Generalized Precedence Relations. Mgmt. Sci. 38, 1245–1263.
Franck, B. and K. Neumann. 1996. Priority-Rule Methods for the Resource-Constrained Project Scheduling Problem with Minimal and Maximal Time Lags-An Emprical Analysis. Proceedings of the Fifth International Workshop on Project Management and Scheduling, 11-13 April, Poznan, 88–91.
Grinold, R. C. 1972. The Payment Scheduling Problem, Nav. Res. Log. Quart. 19, 123–136.
Herroelen, W. and E. Gallens. 1993. Computational Experience with an Optimal Procedure for the Scheduling of Activities to Maximize the Net Present Value of Projects. Eur. J. Opnl. Res. 65, 274–277.
Herroelen, W., E. Demeulemeester, and P. Van Dommelen. 1996. An Optimal Recursive Search Procedure for the Deterministic Unconstrained Max-npv Project Scheduling Problem. Research Report 9603, Department of Applied Economics, Katholieke Universiteit Leuven.
Herroelen, W., P. Van Dommelen and E. Demeulemeester. 1997. Project Network Models with Discounted Cash Flows: A Guided Tour through Recent Developments, Eur. J. Opnl. Res. 100, 97–121.
Herroelen, W., E. Demeulemeester and B. De Reyck. 1998. A Classification Scheme for Project Scheduling Problems, in: Weglarz J. (Ed.), Handbook on Recent advances in Project Scheduling, Kluwer Academic Publishers, this volume.
Kerbosh, J. A. G. M. and H. J. Schell. 1975. Network Planning by the Extended METRA Potential Method. Report KS-1.1, University of Technology Eindhoven, Department of Industrial Engineering.
Kolisch, R. 1996. Efficient Priority Rules for the Resource-Constrained Project Scheduling Problem. J. Opns. Mgmt. 14, 179–192.
Kolisch, R., A. Sprecher and A. Drexl. 1995. Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems. Mgmt. Sci. 41, 1693–1703.
Lawler, E. L. 1976. Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.
Mastor, A. A. 1970. An Experimental and Comparative Evaluation of Production Line Balancing Techniques. Mgmt. Sci. 16, 728–746.
Mingozzi, A., V. Maniezzo, S. Ricciardelli, and L. Bianco. 1998. An Exact Algorithm for Project Scheduling with Resource Constraints Based on a New Mathematical Programming Formulation. Mgmt. Sci., to appear.
Moder, J. J., C. R. Phillips, and E. W. Davis. 1983. Project Management with CPM, PERT and Precedence Diagramming. Van Nostrand Reinhold Company, Third Edition.
Neumann, K. and C. Schwindt. 1997. Activity-on-Node Networks with Minimal and Maximal Time Lags and Their Application to Make-to-Order Production. OR Spektrum. 19, 205–217.
Neumann, K. and J. Zhan. 1995. Heuristics for the Minimum Project-Duration Problem with Minimal and Maximal Time Lags under Fixed Resource Constraints. J. Intelligent Manufacturing. 6, 145–154.
Pascoe, T. L. 1966. Allocation of Resources — CPM, Rev.fr. Reck Opér. 38, 31–38.
Patterson, J. H. 1984. A Comparison of Exact Procedures for Solving the Multiple Resource-Constrained Project Scheduling Problem. Mgmt. Sci. 30, 854–867.
Roy, B. 1962. Graphes et Ordonnancement. Rev.fr. Reck Opér. 25, 323–333.
Russell, A. H. 1970. Cash Flows in Networks. Mgmt. Sci. 16, 357–373.
Schwindt, C. 1996. Generation of Resource-Constrained Project Scheduling Problems with Minimal and Maximal Time Lags. Report WIOR-489, Institut für Wirtschaftstheorie und Operations Research, Universität Karlsruhe.
Schwindt, C. and K. Neumann. 1996. A New Branch-and-Bound-Based Heuristic for Resource-Constrained Project Scheduling with Minimal and Maximal Time Lags. Proceedings of the Fifth International Workshop on Project Management and Scheduling, 11–13 April, Poznan, 212–215.
Simpson III, W. P. and J. H. Patterson. 1992. A Parallel Exact Solution Procedure for the Multiple Resource-Constrained Project Scheduling Problem. Research Report, Indiana University.
Sprecher, A. and A. Drexl. 1996. Minimal Delaying Alternatives and Semi-Active Timetabling in Resource-Constrained Project Scheduling. Research Report 426, Christian-Albrechts-Universität zu Kiel.
Wiest, J. D. 1981. Precedence Diagramming Methods: Some Unusual Characteristics and their Implications for Project Managers, J. Opns. Mgmt. 1, 121–130.
Zhan, J. 1994. Heuristics for Scheduling Resource-Constrained Projects in MPM Networks. Eur. J. Opnl. Res. 76, 192–205.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
De Reyck, B., Demeulemeester, E., Herroelen, W. (1999). Algorithms for Scheduling Projects with Generalized Precedence Relations. In: Węglarz, J. (eds) Project Scheduling. International Series in Operations Research & Management Science, vol 14. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5533-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5533-9_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7529-6
Online ISBN: 978-1-4615-5533-9
eBook Packages: Springer Book Archive