Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Naval research logistics, 1990-10, Vol.37 (5), p.773-787
Ort / Verlag
New York: Wiley Subscription Services, Inc., A Wiley Company
Erscheinungsjahr
1990
Link zum Volltext
Quelle
Wiley Online Library
Beschreibungen/Notizen
In this article we deal with the shortest queue model with jockeying. We assume that the arrivals are Poisson, each of the exponential servers has his own queue, and jockeying among the queues is permitted. Explicit solutions of the equilibrium probabilities, the expected customers, and the expected waiting time of a customer in the system are given, which only depend on the traffic intensity. Numerical results can be easily obtained from our solutions. Several examples are provided in the article.