Abstract
We consider the scheduling of interdependent subprojects incurring costs for early or tardy completion w.r.t. given milestones. Each subproject consists of several activities between which minimum and maximum start-to-start time lags have to be observed. In addition, the processing of activities takes up scarce shared resources. The problem is to determine an activity schedule complying with the temporal constraints such that the resource requirements can be matched by the capacities at any point in time and the earliness-tardiness costs of the project are minimized. For solving the resource-unconstrained version of this problem, we propose a primal and a dual algorithm which are based on the iterative calculation of locally optimal descent and ascent directions, respectively. An initial (generally resource-infeasible) schedule for the problem with resource constraints is determined by applying the primal method to the resource relaxation. Within a branch-and-bound algorithm, resource conflicts are resolved by enumerating sets of precedence constraints between activities which are executed simultaneously and whose requirements exceed the capacity of at least one resource. At each enumeration node, the corresponding relaxation is solved by the dual algorithm starting with the schedule of the father node.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
De Reyck, B., Herroelen, W. (1998): An optimal procedure for the resource-constrained project scheduling problem with discounted cash flows and generalized precedence relations. Computers and Operations Research 25, 1–17.
Hiriart-Urruty, J.-B., Lemaréchal, C. (1993): Convex Analysis and Minimization Algorithms I. Springer, Berlin.
Icmeli, O., Erengüç, S.S. (1996): A branch-and-bound algorithm for the resource-constrained project scheduling problem with discounted cash flows. Management Science 42, 1395–1408.
Schwindt, C., Zimmermann J. (1998): Maximizing the net present value of projects subject to temporal constraints. Report WIOR-536, Institute for Economic Sciences and Operations Research, University of Karlsruhe.
Serafini, P., Speranza, M.G. (1994a): A decomposition approach for a resource-constrained project scheduling problem. European Journal of Operational Research 75, 112–135.
Serafini, P., Speranza, M.G. (1994b): A decomposition approach in a DSS for a resource-constrained project scheduling problem. European Journal of Operational Research 79, 208–219.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwindt, C. (2000). Minimizing Earliness-Tardiness Costs of Resource-Constrained Projects. In: Inderfurth, K., Schwödiauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Wäscher, G. (eds) Operations Research Proceedings 1999. Operations Research Proceedings 1999, vol 1999. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-58300-1_62
Download citation
DOI: https://doi.org/10.1007/978-3-642-58300-1_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67094-0
Online ISBN: 978-3-642-58300-1
eBook Packages: Springer Book Archive