Zusammenfassung
Es wird das zeitabhängige Verhalten der in den WartesystemenM (Y)/G m/1 undG I m/M (Y)/1 eingebetteten Markoff-Ketten für die Zahl der Einheiten im System und für mit der Betriebsperiode zusammenhängende Größen behandelt. Mit elementaren kombinatorischen Methoden wird ein einfacher Algorithmus abgeleitet, mit dem die Lösungen explizit bestimmt werden können. Neben den genannten Wartesystemen findet der Algorithmus Anwendung bei speziellen stochastischen Lagerhaltungsmodellen und in der Damm-Theorie.
Summary
Time dependent solutions for Markov-chains imbedded in the queuing systemsM (Y)/Gm/1 andGI m/M(Y)/1 are treated. By elementary combinatorial methods a simple algorithm is derived to calculate explicitely the distribution of the number of customers in the service system and of quantities connected with the busy period. The algorithm may be used also in special inventory systems and in the theory of dams.
This is a preview of subscription content, log in via an institution to check access.
Literaturverzeichnis
Bailey, N. T. J.: On queuing processes with bulk service. J. Roy. Stat. Soc.B16, 1954, 80–87.
Bhat, U. N.: Imbedded Markov chain analysis of single server bulk queues. J. Austr. Math. Soc.4, 1963, 244–263.
Feller, W.: An introduction to probability theory and its applications, vol. 1, 3rd ed., New York, 1968.
Ghosal, A.: Some aspects of queuing and storage systems. Berlin, 1970.
Kendall, D. G.: Stochastic processes occuring in the theory of queues and their analysis by the method of the imbedded Markov chain. Ann. Math. Statist.24, 1953, 338–354.
Moran, P. A. P.: A probability theory of dams and storage systems. Aust. J. Appl. Sci.5, 1954, 116 bis 124.
Prabhu, N. U.: Queues and inventories, New York, 1965.
Prabhu, N. U. andU. N. Bhat: Some first passage problems and their application to queues. Sankhya25, 1963, 281–292.
Takacs, L.: A single server queue with recurrent input and exponentially distributed service times. J. Oprs. Res.10, 1962a, 395–399.
——: The probability law of the busy period for two types of queuing processes. J. Oprs. Res.9, 1961a, 402–407.
——: A generalisation of the ballot problem and its application in the theory of queues. J. Am. Stat. Assoc.57, 1962b, 327–337.
——: Transient behavior of single-server queuing processes with Erlang input. Transact. Amer. Mathem. Soc.100, 1961b, 1–28.
——: The transient behavior of a single server queuing process with recurrent input and Gamma service time. Ann. Math. Statist.32, 1961c, 1286–1298.
--: Introduction to the theory of queues, New York, 1962c.
Yeo, G. F.: The time-dependent solution for an infinite dam with discrete additive inputs. J. Roy. Stat. Soc. B23, 1961, 173–179.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Schellhaas, H. Ein Algorithmus für das zeitabhängige Verhalten eingebetteter Markoff-Ketten bei den WartesystemenM (Y)/Gm/1 undGI m/M(Y)/1. Unternehmensforschung Operations Research 15, 229–239 (1971). https://doi.org/10.1007/BF01939832
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01939832