Abstract
This paper deals with a problem of optimization of resource allocation in a project plan. It is assumed that the technological ordering of activities in a project is defined by the project graph. The predecessor-successor relations of activities are mapped into a set of transformations, where the state variables are the amounts of work required to complete the activities. The resources allocated to each activity are considered as decision variables. They are constrained when resources are limited. This enables one to consider the project execution as a discrete multistage decision process with the associated objective function. The optimization of this process is viewed as a dynamic programming problem. It is shown that the high dimensionality of the functional equations that appear can be overcome by means of (a) subproject programming, (b) two-level concept of management control evaluation, and (c) by approximation in policy space.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
