Abstract
The previous chapters of this book have dealt mainly with decision problems related to managing an individual service network. The implicit assumption underlying those chapters is that the network management, while considering alternative policies, should arrive at a solution that is solely based on the network’s own resources. In practice there are situations in which cooperation between adjacent networks might be considered. For example, a municipality may wish to request the services of an emergency unit (e.g., an ambulance, a fire engine) from a neighboring municipality at times when all its own local servers are busy.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahituv, N., and O. Berman, “Negotiating a Coordination Agreement between Two Adjacent Service Networks,” TIMS Studies in the Management Sciences 22, 155–182 (1986).
Keeney, R. L., and H. Raiffa, Decisions with Multiple Objectives: Preferences and Value Tradeoffs, Wiley, New York, 1976.
Kleinrock, L., Queueing Systems, Vol. 1: Theory, Wiley, New York, 1975.
Larson, R. C., “A Hypercube-Queueing Model for Facility Location and Redistricting in Urban Emergency Services,” Computers and Operations Research 1, 67–95 (1974).
Luce, R. D., and H. Raiffa, Games and Decisions, Wiley, New York, 1957.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Plenum Press, New York
About this chapter
Cite this chapter
Ahituv, N., Berman, O. (1988). Negotiating Cooperation between Adjacent Service Networks. In: Operations Management of Distributed Service Networks. Applications of Modern Technology in Business. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0991-8_9
Download citation
DOI: https://doi.org/10.1007/978-1-4613-0991-8_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8281-5
Online ISBN: 978-1-4613-0991-8
eBook Packages: Springer Book Archive