Resource Allocation of a Multi-Resource Project for Variable Resource Availabilities

Abstract An algorithm for resource allocation of multi-resource projects is described for the assumption of unlimited resource availabilities. The basis of the allocation is a binary enumeration of all feasible activity combinations, from which the daily optimum is obtained. Optimality is defined by the minimal ‘schedule deviation,’ which measures the weighted deviation squares between future resource loads and currently assigned resource levels. The algorithm simplifies both scheduling and project control, since the next periods schedule depends only on the current schedule status. Appropriate changes in levels for all resources over the project duration are consistent with the needs of project managers in practice.