An investigation of resource-allocation decisions by means of project networks.

Abstract

This paper investigates the relationship between resource allocation and ES-policies, which are a type of scheduling policies introduced for stochastic scheduling and which can be represented by a directed acyclic graph. We present a formal treatment of resource flows as are presentation of resource-allocation decisions, extending the existing literature. A number of complexity results are established, showing that a number of recently proposed objective functions for evaluating the quality of ES-policies lead to difficult problems. Finally, some reflections are provided on possible effciency enhancements to enumeration algorithms for ES-policies.Complexity; Project scheduling; Resource allocation; Resource constraints;