Abstract
A calendar contains working days and non-working days. How to make time planning for a project, when some activities cannot be interrupted by non-working days or in some time distances between start times of activities also non-working days count, is a problem often facing us when undertaking a project realization. In this paper an exact method to solve this problem is presented and the optimality of this method is proved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bellman R (1958) On a routing problem, Quart. Appl. Math. 16:87–90
Gläss/Bamesreiter (1977) Netzplantechnik, Wirtschaftsverlag Langen-Müller/Herbig
Holzschuh G (1977) Netzplantechnik, Elitera-Verlag Berlin
Nemhauser GL, et al., (1989) Handbooks in OR & MS, Vol. 1, Elsevier Science Publishers BV (North-Holland), 249–265
Neumann K (1989) Netzplantechnik: Grundlagen des Operations Research, Band 2,2. Aufl., Berlin
Pape U (1980) Algorithm 562: Shortest path lengths, ACM Trans. Math. Software 6:450–455
Reichert O (1977) Integierte Netzplantechnik, Verlag-Chemie, Weinheim, New York
Zhan J (1988) Kalendrierung der Terminplanung in MPM-Netzplänen, Institut für Wirtschaftstheorie and Operations Research, University of Karlsruhe, Report WIOR-334
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zhan, J. Calendarization of time planning in MPM networks. ZOR - Methods and Models of Operations Research 36, 423–438 (1992). https://doi.org/10.1007/BF01415759
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01415759