A single queue with mutually replacing m servers

Customers arriving in a Poisson stream are served one by one exponentially by the m servers 81, 82, ... .S,«. A server who has just completed a service either continues the next service or is replaced by another server. The replacement of server at each service completion is governed by a probabilis...

Full description

Autores:
Madan, K. C.
Tipo de recurso:
Article of journal
Fecha de publicación:
1998
Institución:
Universidad Nacional de Colombia
Repositorio:
Universidad Nacional de Colombia
Idioma:
spa
OAI Identifier:
oai:repositorio.unal.edu.co:unal/42211
Acceso en línea:
https://repositorio.unal.edu.co/handle/unal/42211
http://bdigital.unal.edu.co/32308/
Palabra clave:
Poisson stream
exponential service
availability criterion
Laplace Transform
probability generating service
sequential service
steady state
mean queue length
Rights
openAccess
License
Atribución-NoComercial 4.0 Internacional