Locating an n-server facility in a stochastic environment
type: Item
instance of: scholarly article
title: Locating an n-server facility in a stochastic environment
zbMATH Open document ID: 0608.90028
DOI: 10.1016/0305-0548(85)90050-4
author: Samuel S. Chiu
author: Richard C. Larson
published in: Computers \& Operations Research
publication date: 1985-01-01T00:00:00Z
review text: We consider a demand-responsive service system in which n mobile units (servers) are garaged at one facility. Service demands arrive in time as a homogeneous Poisson process, but are located over the service region according to an arbitrary probability law. Given a random service demand, either (1) a mobile unit is dispatched to the demand's location to provide on-scene service or (2) the demand is lost (i.e. it is handled by some back-up system). The resultant queueing system is an M/G/n loss system operating in steady state. The objective is to locate the garage facility so that the average cost of response is minimized, where the cost of response is a weighted sum of mean travel time to a random serviced demand and the cost of a lost demand, the weights being the respective probabilities of occurrence. We show that the optimum facility location reduces to Hakimi's well-known minisum location.
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 3984931
zbMATH Keywords: demand-responsive service system
zbMATH Keywords: M/G/n loss system
zbMATH Keywords: steady state
zbMATH Keywords: garage facility
zbMATH Keywords: weighted sum of mean travel time
zbMATH Keywords: optimum facility location
zbMATH Keywords: minisum location
MaRDI profile type: Publication
full work available at URL: 0305-0548(85)90050-4
OpenAlex ID: W1993318170
cites work: Optimal Server Location on a Network Operating as an M/G/1 Queue
cites work: The minisum location problem on an undirected network with continuous link demands
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
cites work: A Combinatorial Method in the Theory of Queues
cites work: An extension of Erlang's loss formula
description: scientific article; zbMATH DE number 3984931