Allocation of resources in an information system

Abraham Bookstein

Journal of the American Society for Information Science, 1974, vol. 25, issue 1, 52-58

Abstract: This paper considers the problem of allocating resources among various locations in an information system where phases of a process are carried out. The approach taken combines queueing theory and dynamic programming. As an illustration of this approach, two prototype problems are considered in some detail: the distribution of computer terminals among various functions requiring access to a computer, and the distribution of personnel among the various phases of the process of cataloging a book. The technique is found to be both efficient and flexible.

Date: 1974
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/asi.4630250107

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:25:y:1974:i:1:p:52-58

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().