Locating an n-server facility in a stochastic environment

DOI10.1016/0305-0548(85)90050-4MaRDI QIDQ1086133zbMATH OpenOpenAlexFDO

Authors Samuel S. Chiu, Richard C. Larson

Publication date 1985

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(85)90050-4

zbMATH Keywords

demand-responsive service systemgarage facilityM/G/n loss systemminisum locationoptimum facility locationsteady stateweighted sum of mean travel time

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Queues and service in operations research (90B22)

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.

Recommendations

• Optimal Server Location on a Network Operating as an M/G/1 Queue
• Optimal M/G/1 Server Location on a Network Having a Fixed Facility
• Optimal positioning of a mobile service unit on a line
• Stochastic location-assignment on an interval with sequential arrivals
• Facility location models for immobile servers with stochastic demand

Cites work

• A Combinatorial Method in the Theory of Queues
• An extension of Erlang's loss formula
• Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel
• Optimal Server Location on a Network Operating as an M/G/1 Queue
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The minisum location problem on an undirected network with continuous link demands

Cited in

(14)

• Locating and staffing service centers under service level constraints
• Location of multiple-server congestible facilities for maximizing expected demand, when services are non-essential
• Optimal positioning of a mobile service unit on a line
• Locating repair shops in a stochastic environment
• Designing a drone delivery network with automated battery swapping machines
• scientific article; zbMATH DE number 3896624 (Why is no real title available?)
• Optimal M/G/1 Server Location on a Network Having a Fixed Facility
• Facility location models for immobile servers with stochastic demand
• Location of single-server immobile facilities subject to a loss constraint
• Locating a service facility with some unserviced demand
• A note on a stochastic location problem
• A center location problem with congestion
• Filtering policies in loss queueing network location problems
• Stochastic location-assignment on an interval with sequential arrivals

This page was built for publication: Locating an n-server facility in a stochastic environment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086133)