Premium
Algorithmic and approximation analyses of the shorter queue model
Author(s) -
Rao B. M.,
Posner M. J. M.
Publication year - 1987
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(198706)34:3<381::aid-nav3220340306>3.0.co;2-k
Subject(s) - fork–join queue , queue , computer science , bounded function , poisson distribution , exponential function , exponential distribution , mathematical optimization , mathematics , queue management system , statistics , mathematical analysis , programming language
A system of two parallel queues where the arrivals from a single stream of customers join the shorter queue is considered. Arrivals form a homogeneous Poisson stream and the service times in each of the two queues are independent exponential variates. By treating one of the queues as bounded, the steady‐state probability vector for the system can be expressed in a modified matrix‐geometric form and can be computed efficiently. Computational procedures for the sojourn time distribution and characteristics of the departure stream are developed. Some numerical results are presented, and based on these results an efficient approximation scheme for the model is developed which can be readily extended to systems with more than two parallel queues.