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
id UNACIONAL2_761954ca3c81377e9d26a75bbb547413
oai_identifier_str oai:repositorio.unal.edu.co:unal/42211
network_acronym_str UNACIONAL2
network_name_str Universidad Nacional de Colombia
repository_id_str
spelling Atribución-NoComercial 4.0 InternacionalDerechos reservados - Universidad Nacional de Colombiahttp://creativecommons.org/licenses/by-nc/4.0/info:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf2Madan, K. C.8a2efd24-5f12-48b5-a9c8-e21d3170b0e83002019-06-28T10:37:26Z2019-06-28T10:37:26Z1998https://repositorio.unal.edu.co/handle/unal/42211http://bdigital.unal.edu.co/32308/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 probabilistic criterion of availability of servers. Transient solutions in terms of Laplace transforms of the probability generating functions are obtained and among some special cases the earlier known results of Madan (1990) for the case of 2 servers are deduced. The steady state solutions and the mean queue lengths have been explicitly for some particular cases.application/pdfspaUniversidad Nacional de Colombiahttp://revistas.unal.edu.co/index.php/estad/article/view/31799Universidad Nacional de Colombia Revistas electrónicas UN Revista Colombiana de EstadísticaRevista Colombiana de EstadísticaRevista Colombiana de Estadística; Vol. 22, núm. 1 (1998); 1-8 Revista Colombiana de Estadística; Vol. 22, núm. 1 (1998); 1-8 0120-1751Madan, K. C. (1998) A single queue with mutually replacing m servers. Revista Colombiana de Estadística; Vol. 22, núm. 1 (1998); 1-8 Revista Colombiana de Estadística; Vol. 22, núm. 1 (1998); 1-8 0120-1751 .A single queue with mutually replacing m serversArtículo de revistainfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1http://purl.org/coar/version/c_970fb48d4fbd8a85Texthttp://purl.org/redcol/resource_type/ARTPoisson streamexponential serviceavailability criterionLaplace Transformprobability generating servicesequential servicesteady statemean queue lengthORIGINAL31799-116138-1-PB.pdfapplication/pdf2650133https://repositorio.unal.edu.co/bitstream/unal/42211/1/31799-116138-1-PB.pdf16d088d588248364e72020032e9ae4e4MD51THUMBNAIL31799-116138-1-PB.pdf.jpg31799-116138-1-PB.pdf.jpgGenerated Thumbnailimage/jpeg7751https://repositorio.unal.edu.co/bitstream/unal/42211/2/31799-116138-1-PB.pdf.jpgf7603a28b4ee9a1a5230901a8f786aa7MD52unal/42211oai:repositorio.unal.edu.co:unal/422112024-02-03 23:07:13.277Repositorio Institucional Universidad Nacional de Colombiarepositorio_nal@unal.edu.co
dc.title.spa.fl_str_mv A single queue with mutually replacing m servers
title A single queue with mutually replacing m servers
spellingShingle A single queue with mutually replacing m servers
Poisson stream
exponential service
availability criterion
Laplace Transform
probability generating service
sequential service
steady state
mean queue length
title_short A single queue with mutually replacing m servers
title_full A single queue with mutually replacing m servers
title_fullStr A single queue with mutually replacing m servers
title_full_unstemmed A single queue with mutually replacing m servers
title_sort A single queue with mutually replacing m servers
dc.creator.fl_str_mv Madan, K. C.
dc.contributor.author.spa.fl_str_mv Madan, K. C.
dc.subject.proposal.spa.fl_str_mv Poisson stream
exponential service
availability criterion
Laplace Transform
probability generating service
sequential service
steady state
mean queue length
topic Poisson stream
exponential service
availability criterion
Laplace Transform
probability generating service
sequential service
steady state
mean queue length
description 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 probabilistic criterion of availability of servers. Transient solutions in terms of Laplace transforms of the probability generating functions are obtained and among some special cases the earlier known results of Madan (1990) for the case of 2 servers are deduced. The steady state solutions and the mean queue lengths have been explicitly for some particular cases.
publishDate 1998
dc.date.issued.spa.fl_str_mv 1998
dc.date.accessioned.spa.fl_str_mv 2019-06-28T10:37:26Z
dc.date.available.spa.fl_str_mv 2019-06-28T10:37:26Z
dc.type.spa.fl_str_mv Artículo de revista
dc.type.coar.fl_str_mv http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.driver.spa.fl_str_mv info:eu-repo/semantics/article
dc.type.version.spa.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.coar.spa.fl_str_mv http://purl.org/coar/resource_type/c_6501
dc.type.coarversion.spa.fl_str_mv http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.content.spa.fl_str_mv Text
dc.type.redcol.spa.fl_str_mv http://purl.org/redcol/resource_type/ART
format http://purl.org/coar/resource_type/c_6501
status_str publishedVersion
dc.identifier.uri.none.fl_str_mv https://repositorio.unal.edu.co/handle/unal/42211
dc.identifier.eprints.spa.fl_str_mv http://bdigital.unal.edu.co/32308/
url https://repositorio.unal.edu.co/handle/unal/42211
http://bdigital.unal.edu.co/32308/
dc.language.iso.spa.fl_str_mv spa
language spa
dc.relation.spa.fl_str_mv http://revistas.unal.edu.co/index.php/estad/article/view/31799
dc.relation.ispartof.spa.fl_str_mv Universidad Nacional de Colombia Revistas electrónicas UN Revista Colombiana de Estadística
Revista Colombiana de Estadística
dc.relation.ispartofseries.none.fl_str_mv Revista Colombiana de Estadística; Vol. 22, núm. 1 (1998); 1-8 Revista Colombiana de Estadística; Vol. 22, núm. 1 (1998); 1-8 0120-1751
dc.relation.references.spa.fl_str_mv Madan, K. C. (1998) A single queue with mutually replacing m servers. Revista Colombiana de Estadística; Vol. 22, núm. 1 (1998); 1-8 Revista Colombiana de Estadística; Vol. 22, núm. 1 (1998); 1-8 0120-1751 .
dc.rights.spa.fl_str_mv Derechos reservados - Universidad Nacional de Colombia
dc.rights.coar.fl_str_mv http://purl.org/coar/access_right/c_abf2
dc.rights.license.spa.fl_str_mv Atribución-NoComercial 4.0 Internacional
dc.rights.uri.spa.fl_str_mv http://creativecommons.org/licenses/by-nc/4.0/
dc.rights.accessrights.spa.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv Atribución-NoComercial 4.0 Internacional
Derechos reservados - Universidad Nacional de Colombia
http://creativecommons.org/licenses/by-nc/4.0/
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.mimetype.spa.fl_str_mv application/pdf
dc.publisher.spa.fl_str_mv Universidad Nacional de Colombia
institution Universidad Nacional de Colombia
bitstream.url.fl_str_mv https://repositorio.unal.edu.co/bitstream/unal/42211/1/31799-116138-1-PB.pdf
https://repositorio.unal.edu.co/bitstream/unal/42211/2/31799-116138-1-PB.pdf.jpg
bitstream.checksum.fl_str_mv 16d088d588248364e72020032e9ae4e4
f7603a28b4ee9a1a5230901a8f786aa7
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
repository.name.fl_str_mv Repositorio Institucional Universidad Nacional de Colombia
repository.mail.fl_str_mv repositorio_nal@unal.edu.co
_version_ 1814089373150347264

Publicaciones similares