Abstract
A policy for allocating each demand for an emergency service, arising within a region, to a currently available one of a set of service units, so as to minimise overall average response time, results in a straightforward generalisation of the elementary nearest-neighbour rule.
Zusammenfassung
Es wird gezeigt, daß die Zuordnung eines momentan verfügbaren Gerätes bei einer aus einer bestimmten Gegend kommenden Anforderung eines Notdienstes auf eine Verallgemeinerung der “Regel des nächsten Nachbaumes” führt, wenn die mittlere Gesamtantwortzeit minimiert werden soll.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Carter GM, Chaiken JM, Ignall E (1972) Response areas for two emergency service units. Operations Research 20:571–594
Corley HW Jr (1972) Duality relationships for a partitioning problem. SIAM J Applied Maths 23:490–494
Corley HW Jr, Roberts SD (1972) A partitioning problem with applications in regional design. Operations Research 20:1010–1019
Cuninghame-Green RA, Harries G (1985) Dirichlet domains for emergency services. Methods of Operations Research. Oelgeschlager, Gunn & Hain
Hestenes MR (1966) Calculus of variations and optimal control theory. John Wiley
Lowe TJ, Hurter AP Jr (1976) The generalised market area problem. Management Science 10:1105–1115
Morse PM (1958) Queues, inventories and maintenance. John Wiley
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Cuninghame-Green, R.A., Harries, G. Nearest-neighbour rules for emergency services. Zeitschrift für Operations Research 32, 299–306 (1988). https://doi.org/10.1007/BF01920299
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01920299