The use of queuing networks and mixed integer programming to allocate resources optimally within a library layout

J. Macgregor Smith

Journal of the American Society for Information Science, 1981, vol. 32, issue 1, 33-42

Abstract: Queuing networks, mixed integer programming, and expected utility theory are combined together to model effectively the library building programming problem. The model is utilized with empirical data to allocate activities, equipment, and staff optimally within a library layout.

Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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

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:32:y:1981:i:1:p:33-42

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 ().