Abstract
The project scheduling problem we are dealing with in this paper forms an extension of the well-known CPM model by additionally allowing maximum time distances between the jobs. This implies that already the determination of a feasible schedule is NP-hard. We have developed some heuristic strategies for this scheduling problem both with respect to the objective of minimizing the project duration and with respect to resource levelling. At the end, the results of an empirical analysis of these methods are given.
Chapter PDF
References
Bartusch M (1983) Optimierung von NetzpHinen mit Anordnungsbeziehungenbei knappen Ressourcen. Dissertation RWTH Aachen
Davis E W (1975) Project Network Summary Measures and Constrained-Resource Scheduling. AIIE Transactions 7, No 2: 132–142
Golden B L, Assad A A (1984) A Decision-Theoretic Framework for Comparing Heuristics. European Journal of OR 18, No 2: 167–171
Neumann K (1975) Operations-Research-Verfahren Band III. Carl Hanser. München/Wien
Stinson J P, Davis E W, Khumawala B M (1978) Multiple Resource-Constrained Scheduling Using Branch and Bound. AIIE Transactions 10: 252–259
Talbot F B, Patterson J. H (1978) An Efficient Integer Programming Algorithm with Network Cuts for Solving Resource-Constrained Scheduling Problems. Management Science 24: 1163–1174
Zhan J (1991) Heuristsiche Ressourcenplanung in MPM-Netzplänen mit beschränkter Kapazität. Dissertation Universität Karlsruhe
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brinkmann, K. (1993). Resource-Constrained Project Scheduling with Maximum Time Distances. In: Karmann, A., Mosler, K., Schader, M., Uebe, G. (eds) Operations Research ’92. Physica, Heidelberg. https://doi.org/10.1007/978-3-662-12629-5_31
Download citation
DOI: https://doi.org/10.1007/978-3-662-12629-5_31
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-0679-3
Online ISBN: 978-3-662-12629-5
eBook Packages: Springer Book Archive