Комбинаторные методы в теории случайных процессов - Такач Л.
Скачать (прямая ссылка):
general class of holding times, Operations Res., 4 (1956), 711-732.
[49] McMillan B., Riordan J., A moving single server problem, Ann. Math.
Statist., 28 (1957), 471-478.
[50] M о r i m u r a H., On the number of served customers in a busy
period,
I. О per at. Res. Soc. Japan, 4 (1961-62), 67-75.
[51] N e u t s M. F., The distribution of the maximum length of a Poisson
queue during a busy period, Operations Res., 12 (1964), 281-285.
[52] Neuts M. F., An alternative proof of a theorem of Takacs on the
Gf/M/1 queue, Operations Res., 14 (1966), 313-316.
[53] Pollaczek F., Ober eine Aufgabe der Wahrscheinlichkeitstheorie, 1-
II, Math. Z" 32 (1930), 64-100, 729-750.
[54] Pollaczek F., Ober das Warteproblem, Math. Z., 38 (1934), 492-537.
[55] Pollaczek F., Problemes stochastiques poses par le phenomene de
formation d'une queue d'attente a un guichet et par des phenomenes
apparentes, Memorial des Sciences Mathematiques, fasc. 136, Paris, 1957.
[56] P r a b h u N. U., Application of storage theory to queues with
Poisson arrivals, Ann. Math. Statist., 31 (1960), 475-482.
[57] P r a b h u N. U., Some results for the queue with Poisson arrivals,
J. Roy.
Statist. Soc., Ser. B, 22 (1960), 104-107.
[58] P r a b h u N. U., В h a t U. N., Some first passage problems and
their application to queues, Sankhya, Ser. A, 25 (1963), 281-292.
[59] P r a b h u N. U., В h a t U. N., Further results for the queue with
Poisson arri-
vals, Operations Res., 11 (1963), 380-385.
[60] Reich E., On the integrodifferential equation of Takacs, I-II, Ann.
Math. Statist., 29 (1958), 563-570; 30 (1959), 143-148.
[61] Rice S. O., Single server systems-II, Busy periods, Bell. System
Tech. J., 41 (1962), 279-310.
[62] R i о r d an J., Delays for last-come first-served service and the
busy period, Bell. System Tech. J., 40 (1961), 785-793.
[63] P и о p д а н Дж., Вероятностные системы обслуживания, изд-во
"Связь", М., 1966.
[64] Runnenburg Th. J., Probabilistic interpretation of some formulae in
queueing theory, Bull. Inst. Internat. Statist., 37 (1960), 405-414.
[65] Runnenburg Th. J., On the use of Markov processes in one-server
waitingtime problems and renewal theory, Thesis, Amsterdam, 1960.
[66] С а а т и Т. Л., Элементы теории массового обслуживания и ее
приложения, изд-во "Сов. радио", М., 1965.
140
Гл. 5. Теория очередей
[67] S h a n b a g D. N., On queues with Poisson service time, Austral.
J. Statist., 5 (1963), 57-61.
[68] Smith W. L., On the distribution of queueing times, Proc. Cambridge
Phil. Soc., 49 (1953), 449-461.
[69] S p i t z e г F., The Wiener-Hopf equation whose kernel is a
probability density, Duke Math. J., 24 (1957), 327-343.
[70] S у s к i R., Introduction to congestion theory in telephone
systems, Edinburgh,
1960.
[71] Takacs L., Investigation of waiting time problems by reduction to
Markov processes, Acta Math. Acad. Sci. Hungar., 6 (1955), 101-129.
[72] Takacs L., Transient behavior of single-server queuing processes
with recurrent input and exponentially distributed service times,
Operations Res., 8 (1960), 231-245.
[73] Takacs L., The transient behavior of a single server queueing
process with a Poisson input, Proceedings of the Fourth Berkeley
Symposium on Mathematical Statistics and Probability, Vol. 11, Univ.
California Press, Berkeley,
1961, pp. 535-567.
[74] Takacs L., The transient behavior of a single server queuing process
with recurrent input and gamma service time, Ann. Math. Statist., 32
(1961), 1286-1298.
[75] T а к a с s L., Transient behavior of single-server queueing
processes with Erlang input, Trans. Amer. Math. Soc., 100 (1961), 1-28.
[76] Takacs L., The probability law of the busy period for two types cf
queuing processes, Operations Res., 9 (1961), 402-407.
[77] Takacs L., Introduction to the theory of queues, Oxford Univ. Press,
New York, 1962.
[78] Takacs L., A generalization of the ballot problem and its
application in the theory of queues, J. Amer. Statist. Assoc., 57 (1962),
327-337.
[79] Takacs L., A single-server queue with recurrent input and
exponentially distributed service times, Operations Res., 10 (1962), 395-
399.
[80] Takacs L., A combinatorial method in the theory of queues, J. Soc.
Indust. Appl. Math., 10 (1962), 691-694.
[81] Takacs L., The distribution of the virtual waiting-time for a
single-server queue with Poisson input and general service times,
Operations Res., II (1963), 261-264.
[82] Takacs L., The stochastic law of the busy period for a single-server
queue with Poisson input, J. Math. Anal, and Appl., 6 (1963), 33-42.
[83] Takacs L., The limiting distribution of the virtual waiting time and
the queue size for a single-server queue with recurrent input and general
service times, Sankhya, Ser. A, 25 (1963), 91-100.
[84] Takacs L., The time dependence of a single-server queue with Poisson
input and general service times, Ann. Math. Statist., 33 (1962), 1340-
