Dispatching and Allocating Servers to Stochastically Failing Networks

Michael Moses ()

Management Science, 1972, vol. 18, issue 6, B289-B300

Abstract: The problem considered is that of allocating and dispatching servers to networks whose nodes and/or arcs fail stochastically. A mathematical programming formulation is developed which allocates servers to nodal demands so that expected loss is minimized. From this a zero-one programming problem is formulated to insure whole server allocation and to allow for decreasing service time and cost functions in the number of servers dispatched to a demand. Comparative computer experience with two zero-one codes is reported. Server transfers between subparts of networks, use of the model for prepositioning servers throughout the network and other extensions are discussed in the final section.

Date: 1972
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.6.B289 (application/pdf)

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:inm:ormnsc:v:18:y:1972:i:6:p:b289-b300

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().