Abstract
A properly drawn arrow diagram shows only logical sequence ; any limitations imposed by resources are ignored, and the first schedule is drawn up on the implied assumption that all the resources which it calls for will be available. This is not necessarily so, and even if it is, using the resources as required by the first schedule may be uneconomic. Consider the oil refinery example. Fig. 8.1 is derived from the time-scaled network in Fig. 5.3, and shows the number of foremen usefully employed at any time during the project, if each job requires just one foreman. The greatest number is five. If there is no alternative work available for them during the project, their periods of idleness will roughly equal their periods of employment. It is obvious that the schedule could be improved (for example, by delaying job (6,14), and the problem of resource allocation is, first, to define what we mean by ‘improvement’ and, secondly, to find and apply methods of bringing it about.
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Copyright information
© 1970 A. Battersby
About this chapter
Cite this chapter
Battersby, A. (1970). Resource Allocation—The General Problem. In: Network Analysis. Studies in Management. Palgrave, London. https://doi.org/10.1007/978-1-349-00594-9_8
Download citation
DOI: https://doi.org/10.1007/978-1-349-00594-9_8
Publisher Name: Palgrave, London
Print ISBN: 978-1-349-00596-3
Online ISBN: 978-1-349-00594-9
eBook Packages: Palgrave Business & Management CollectionBusiness and Management (R0)