Theory of Probability and Mathematical Statistics

			Journals Home Search Author Info Subscribe Tech Support Help
ISSN: 1547-7363(e) 0094-9000(p)

Previous number \| Table of contents \| Next number Recently posted articles \| Most recent number \| All numbers Previous Article \| Next Article

On a queueing system with sequential service

Author(s): O. K. Zakusylo; N. P. Lysak
Translated by: V. Semenov
Original publication: Teoriya Imovirnostei ta Matematichna Statistika, vipusk 72 (2005).
Journal: Theor. Probability and Math. Statist. No. 72 (2006), 27-32.
MSC (2000): Primary 60K25, 60Fxx
Posted: August 10, 2006
Retrieve article in: PDF DVI PostScript

Abstract | References | Similar articles | Additional information

Abstract: We consider a queueing system with sequential service such that the amount of unfinished work in the system satisfies the Langevin equation. We study the total time spent by a customer in the system under busy traffic.

References:

1.: O. K. Zakusylo, Markov Processes with Semi-Deterministic Parts of Trajectories, ``Fada'', Kyiv, 2002. (Ukrainian)
2.: P. Lancaster, Theory of Matrices, Academic Press, New York-London, 1969. MR 0245579 (39:6885)
3.: R. W. Wolff, Poisson arrivals see time averages, Oper. Res. 30 (1982), 223-231. MR 0653251 (83d:60105)


	Comments: webmaster@ams.org © Copyright 2008, American Mathematical Society Privacy Statement		Search the AMS