Resource Allocation in Activity Networks Under Deterministic Conditions: A Geometric Programming Approach

摘要

We propose a new paradigm in which the work content of the activity is the basic entity, the decision is the intensity of resource(s) allocated to the activity, and the activity duration is a consequence of such action, given as a function of these two parameters. In the deterministic case with bounds on individual activity allocation as well as global resource availability we propose a geometric program for the resolution of the optimal allocation to optimize an economic objective that is an arbitrary function of the resource utilization and a penalty for tardiness. We illustrate the application of the proposed model and discuss its possible extensions.