dc.creatorMarianov, V
dc.creatorSerra, D
dc.date.accessioned2024-01-10T13:16:39Z
dc.date.accessioned2024-05-02T15:48:54Z
dc.date.available2024-01-10T13:16:39Z
dc.date.available2024-05-02T15:48:54Z
dc.date.created2024-01-10T13:16:39Z
dc.date.issued1998
dc.identifier10.1111/0022-4146.00100
dc.identifier0022-4146
dc.identifierhttps://doi.org/10.1111/0022-4146.00100
dc.identifierhttps://repositorio.uc.cl/handle/11534/78602
dc.identifierWOS:000075447100002
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/9265305
dc.description.abstractWhen dealing with the design of service networks, such as health and emergency medical services, banking or distributed ticket-selling services, the location of service centers has a strong influence on the congestion at each of them, and, consequently, on the quality of service. In this paper, several probabilistic maximal covering location-allocation models with constrained waiting time for queue length are presented to consider service congestion. The first model considers the location of a given number of single-server centers such that the maximum population is served within a standard distance, and nobody stands in line for longer than a given time or with more than a predetermined number of other users. Several maximal coverage models are then formulated with one or more servers per service center. A new heuristic is developed to solve the models and tested in a 30-node network.
dc.languageen
dc.publisherBLACKWELL PUBLISHERS
dc.rightsregistro bibliográfico
dc.titleProbabilistic, maximal covering location-allocation models for congested systems
dc.typeartículo


Este ítem pertenece a la siguiente institución