×

Queueing theory. (English) Zbl 0275.60110


MSC:

60K25 Queueing theory (aspects of probability theory)
60-02 Research exposition (monographs, survey articles) pertaining to probability theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] L. M. Abol’nikov, ?Servicing a nonorderly input process in problems involving a finite number of servers,? Izv. Akad. Nauk SSSR, Tekh. Kiberenetika, No. 3, 12?16 (1965).
[2] L. M. Abol’nikov, ?A multichannel queueing system with batched input,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 41?49 (1967).
[3] L. M. Abol’nikov, ?A nonstationary queueing problem for systems having an infinite number of channels and batched input,? Procl. Peredachi Inform.,4, No. 3, 99?102 (1968).
[4] B. Sh. Abramishvili, ?Smoothness properties of the output flow distribution functions in storage problems,? Trudy Inst. Prikl. Matem. Tbilissk. Univ.,1, 177?182 (1969).
[5] B. Sh. Abramishvili, ?On the construction of multivariate distribution functions and moments in storage problems,? Trudy Inst. Prikl. Matem. Tbilissk. Univ.,1, 169?176 (1969).
[6] O. I. Aven and Ya. A. Kogan. ?Mathematical models of time-sharing computer systems,? Large Systems, Queueing, and Reliability [in Russian], Nauka, Moscow (1970), pp. 170?186.
[7] T. A. Azlarov and M. R. Musamukhamedov, ?Proof of the existence of a stationary regime for a particular queueing system,? Mathematical Methods of Quality Control and Reliability [in Russian], Fan, Tashkent (1969), pp. 70?78.
[8] T. A. Azlarov and M. R. Musamukhamedov, ?Proof of the existence of a stationary regime for a particular queueing system,? Mathematical Methods of Quality Control and Reliability [in Russian], Fan, Tashkent (1969), pp. 70?78.
[9] N. M. Akulinichev, ?Total time of a standby system in the operating state,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 61?73.
[10] N. M. Akulinichev, ?Asymptotic estimate of the reliability of a repairable system,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 54?60.
[11] N. M. Akulinichev and V. A. Ivannikov, ?Asymptotic distribution of the stream of lost calls in a single-channel queueing system with finite waiting time,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 85?90 (1970).
[12] A. M. Aleksandrov, ?Output processes of certain queueing systems,? Trudy Leningrad. Politekh. Inst., No. 275, 18?21 (1967).
[13] A. M. Aleksandrov, ?Problems of a single-server queueing system with finite waiting time,? Trudy Leningrad. Politekh. Inst., No. 275, 22?29 (1967).
[14] A. M. Aleksandrov, ?A particular distribution of state probabilities in queueing systems,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 2, 91?100 (1970).
[15] A. M. Aleksandrov, ?On the busy period of certain systems with dependent service times,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3, 75?85 (1970).
[16] A. A. Alekseev, ?On an inhomogeneous recurrent bulk-service flow,? Kibernetika, No. 1, 41?46 (1966).
[17] O. G. Alekseev, ?Optimization of the reliability of complex systems under several constraints,? Avtomat. i. Telemekhan., No. 112, 177?182 (1967).
[18] G. A. Ambartsumyan, ?On the reading probabilities of an unreliable pulse counter,? Trudy Vychisl. Tsentra Akad. Nauk Arm. SSR i Erevan. Univ., No. 2, 61?66 (1964).
[19] R. V. Ambartsumyan, ?An equation for stationary point processes,? Dokl. Akad. Nauk Arm. SSR,42, No. 3, 141?147 (1966).
[20] M. G. Aminaev, ?Optimum allocation of urban public transportation stops,? Ékonomika i Matem. Metody,5, No. 5, 727?736 (1969).
[21] N. V. Andreev and V. S. Korolyuk, ?A certain monitoring schema for a Poisson process with drift,? Kibernetika, No. 1, 72?74 (1969).
[22] N. V. Andreev and É. S. Shtatland, ?Problems in the control of inhomogeneous birth-and-death processes,? Proc. Seminar: Optimal Decision Theory [in Russian], No. 4, Kiev (1969), pp. 42?46.
[23] G. L. Arsenishvili and N. P. Ezhov, ?Sojourn-time distribution in a given domain for an r-th order semi-Markov processes,? Trudy Inst. Prikl. Matem. Tbilissk. Univ., No. 2, 151?157 (1969). · Zbl 0233.60074
[24] G. L. Arsenishvili and N. P. Ezhov, ?A generalization of Markov chains with semi-Markov mixed chance,? Soobshch. Akad. Nauk Gruz. SSR,54, No. 2, 285?288 (1969). · Zbl 0233.60074
[25] L. G. Afanas’eva, ?On the existence of a limiting distribution in queueing systems with finite sojourn times,? Teor. Veroyat. i Prim.,10, No. 3, 570?578 (1965).
[26] L. G. Afanas’eva, ?Stream of lost inputs in certain queueing systems with constraints,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3, 57?65 (1966).
[27] L. G. Afanas’eva, ?Analytic form of the waiting-time distribution in certain queueing systems with a finite sojourn time,? Nauch. Trudy Krasnodarsk. Politekh. Inst.,23, No. 10, 109?117 (1968).
[28] L. G. Afanas’eva, ?Queueing problems with finite waiting times,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6, 27?37 (1964).
[29] L. G. Afanas’eva and A. P. Alabovskaya, ?Systems with random constraints on the service intervals,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 61?68 (1969).
[30] L. G. Afanas’eva and A. V. Martynov, ?An ergodicity condition for certain queueing systems,? Kibernetika, No. 4, 57?63 (1966).
[31] L. G. Afanas’eva and A. V. Martynov, ?Ergodic properties of queueing systems with constraints,? Teor. Veroyat. i Prim.,12, No. 1, 112?120 (1967).
[32] L. G. Afanas’eva and A. V. Martynov, ?On the ergodic properties of a multi-channel queueing system with a time constraint,? Kibernetika, No. 6, 62?69 (1968).
[33] L. G. Afanas’eva and A. V. Martynov, ?On the ergodic properties of queueing systems with finite service time,? Teor. Veroyat. i Prim.,14, No. 1, 102?112 (1969).
[34] L. G. Afanas’eva and A. V. Martynov, ?Deterministic models of certain queueing systems,? Nauch. Trudy Krasnodarsk. Politekh. Inst.,23, No. 10, 66?81 (1968).
[35] L. G. Afanas’eva and L. I. Shumko, ?On certain queueing systems with a control,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 2, 85?93 (1968).
[36] A. Akhmedov, ?Second-order modeling in application to one server,? Zh.Vychis. Matem. i Matem. Fiz.,4, No. 2, 327?337 (1964).
[37] A. Akhmedov, ?Solution of a problem in queueing theory,? Izv. Akad. Nauk Turkmen. SSR, Ser. Fiz.-Tekh. Khim. Geol. Nauk, No. 6, 33?41 (1965).
[38] G. A. Bagdasaryan, ?On a multiserver queueing system with several types of inputs,? Large Systems, Queueing, and Reliability [in Russian], Nauka, Moscow (1970), pp. 137?142.
[39] V. Bazarov, ?Queue-length distribution in an m-station traffic service system,? Mathematical Methods of Quality Control and Reliability [in Russian], Fan, Tashkent (1969), pp. 85?91.
[40] V. V. Baklan, ?Optimum testing program for a device minimizing average loss,? Proc. Seminar: Cybernetics, Donets Section [in Russian], No. 1, Kiev (1968), pp. 35?47.
[41] E. Yu. Barzilovich, ?Optimization of the testing period for systems unamenable to continuous testing,? Avtomat. i Telemekhan., No. 8, 175?177 (1969).
[42] E. Yu. Barzilovich and V. F. Voskoboev, ?Markov problems in the preventive maintenance of aging systems (survey),? Avtomat. i Telemekhan., No. 12, 88?102 (1967). · Zbl 0178.22201
[43] E. Barkovets, ?Service with a prevalence of nonorderly inputs,? Sborn. Rabot Vychis. Tsentra Moskov. Univ.,6, 279?281 (1967).
[44] É. M. Baskin, ?Passenger waiting times at a bus stop,? Theory and Techniques of Automation [in Russian], Nauka, Moscow (1968), pp. 188?198.
[45] G. P. Basharin, ?Complex queueing systems with several finite queues and impatient inputs,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 274?303.
[46] G. P. Basharin, ?A finite-queue single-server with several input types,? Teor. Veroyat. i Prim.,10, No. 2, 282?296 (1965).
[47] G. P. Basharin, ?A single-server system with an Erlang waiting-time distribution for various input types,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3, 46?53 (1966).
[48] G. P. Basharin, ?Servicing two queues with nonpreemptive priority in a completely accessible system with finite waiting space,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 2, 72?86 (1967).
[49] G. P. Basharin, ?Serving two queues in a single-server system with finite waiting space and preemptive priority,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 106?116 (1967).
[50] G. P. Basharin, ?Poisson service systems with priority and finite waiting space,? [in Russian], Fifth Internat. Teletraffic Congr., Preprints of Technical Papers, Ser. 1, s. a., New York (1967), pp. 66?72.
[51] G. P. Beznosov and B. P. Zelentsov, ?Frequency method of reliability analysis for systems with repair comprising elements of uniform type,? Izv. Sibirsk. Otdel. Akad. Nauk SSSR, Div. 2: Ser. Tekh. Nauk, No. 1, 106?111 (1966).
[52] A. Ya. Beletskii, ?Transient regime in a single-server system with ?impatient customers,?? Izv. VUZov, Matematika, No. 5, 3?5 (1967).
[53] O. S. Belima, ?Investigation of a discrete centralized information-gathering system with cyclosporadic action,? Avtomatika (Kiev), No. 1, 19?28 (1964).
[54] Yu. K. Belyaev, ?Limit theorems for rarefactions,? Teor. Veroyat. i Prim.,8, No. 2, 175?184 (1963).
[55] Yu. K. Belyaev, ?Linear Markov processes and their application to reliability problems,? Proc. Conf. Probability Theory and Mathematical Statistics, Vilnyus, 1960 [in Russian], Gos. Izd. Polit. i Nauch. Lit. SSR (1962), pp. 309?323.
[56] Yu. K. Belyaev, ?Efficiency in the presence of two types of failure,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 303?309.
[57] Yu. K. Belyaev, ?On the number of entries of trajectories of a Markov process into a given set of phase space,? Dokl. Akad. Nauk SSSR,186, No. 6, 1243?1245 (1969).
[58] Yu. K. Belyaev, ?A simplified model of traffic without passing,? Izd. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3, 17?21 (1969).
[59] Yu. K. Belyaev, ?Random sets of scintillations and spikes in random fields,? Soviet-Japanese Symposium on Probability Theory, 1969 [in Russian], Part I, Novosibirsk (1969), pp. 3?10.
[60] Yu. K. Belyaev, ?Distribution of the maximum of a random field and its application to reliability problems,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 2, 77?84 (1970).
[61] B. A. Besedin, ?Synthesis of efficient controllable queueing networks,? Progress in Cybernetics Research [in Russian], Tomsk. Univ., Tomsk (1968), pp. 117?133.
[62] I. T. Bokuchava, ?Tandem queueing systems,? Soobshch. Akad. Nauk Gruz. SSR,47, No. 3, 541?544 (1967).
[63] I. T. Bokuchava, N. K. Donadze, and N. I. Geldiashvili, ?On the departure process of a system with losses,? Soobshch. Akad. Nauk Gruz. SSR,53, No. 1, 37?40 (1969).
[64] V. V. Bolotin, ?Longevity estimates for stationary random loads,? Izv. VUZov, Mashinostroenie, No. 9, 129?134 (1959).
[65] A. D. Bolychevtsev, ?General expressions for the conditional density of excursions of a controlled process,? Information Sampling and Transmission Methods [in Russian], Nauk, Dumka, Kiev (1965), pp. 79?82.
[66] A. A. Borovkov, ?On discrete queueing systems,? Teor. Veroyat. i Prim.,8, No. 3, 251?263 (1963).
[67] A. A. Borovkov, ?Some limit theorems for queueing theory (I),? Teor. Veroyat. i Prim.,9, No. 4, 608?625 (1964).
[68] A. A. Borovkov, ?Some limit theorems for queueing theory (II),? Teor. Veroyat. i Prim.,10, No. 3, 409?437 (1965).
[69] A. A. Borovkov, ?Some limit theorems for the distribution of functionals of processes asymptotically close to Markov processes,? Dokl. Akad. Nauk SSSR,169, No. 3, 507?510 (1966). · Zbl 0214.16902
[70] A. A. Borovkov, ?Asymptotic analysis of certain queueing systems,? Teor. Veroyat. i Prim.,11, No. 4, 675?682 (1966).
[71] A. A. Borovkov, ?Limit principles for queueing processes in multichannel systems,? Sibirsk. Matem. Zh.,8, No. 5, 983?1004 (1967).
[72] A. A. Borovkov, ?Queueing processes in multichannel systems,? Teor. Veroyat. i Prim.,13, No. 1, 180?183 (1968).
[73] A. A. Borovkov, ?Three types of conditions for convergence to diffusion processes,? Dokl. Akad. Nauk SSSR,187, No. 5, 974?977 (1969).
[74] A. A. Borovkov, ?Convergence theorems for processes,? Soviet-Japanese Symposium on Probability Theory, 1969 [in Russian], Part I, Novosibirsk (1969), pp. 19?23.
[75] A. A. Borovkov and V. S. Korolyuk, ?Results of an asymptotic analysis in problems with boundaries,? Teor. Veroyat. i Prim.,10, No. 2, 255?266 (1965).
[76] P. P. Bocharov, ?Service in a single-queue Poisson-Erlang system with finitely many waiting spaces and relative priority,? Probl. Peredachi Inform.,5, No. 4, 50?58 (1969).
[77] P. P. Bocharov, ?Single-queue service system with finitely many waiting spaces and priorities,? Probl. Peredachi Inform.,6, No. 3, 70?77 (1970).
[78] S. M. Brodi, ?A limit theorem for queueing theory,? Ukrainsk. Matem. Zh.,15, No. 1, 76?79 (1963). · Zbl 0117.36002 · doi:10.1007/BF02538049
[79] S. M. Brodi, ?Analysis of queueing systems by means of semi-Markov processes,? Kibernetika, No. 6, 55?58 (1965).
[80] S. M. Brodi and O. N. Vlasenko, ?Reliability of systems having many operating modes,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 165?171.
[81] S. M. Brodi, I. I. Marchenko, and Yu. I. Mel’nik, ?Some characteristics of queueing systems with constraints,? Seminar Proc: Complex Systems and Modeling [in Russian], No. 2, Kiev (1969), pp. 66?76.
[82] S. M. Brodi and V. D. Shpak, ?Application of associated semi-Markov processes to the analysis of system reliability (I),? Kibernetika, No. 5, 90?96 (1970). · Zbl 0229.90012
[83] O. I. Bronshtein, ?On the probability of receiving remote control messages in the event of possible failure and repair of the dispatching station,? Avtomat. i Telemekhan.,24, No. 9, 1267?1271 (1963).
[84] O. I. Bronshtein, ?Assessment of the operation of a centralized information acquisition and processing station with unlimited storage,? Avtomat. i Telemekhan.,25, No. 3, 394?398 (1964).
[85] O. I. Bronshtein, ?On a controlled multiphase queueing system,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 2, 45?50 (1969).
[86] O. I. Bronshtein and E. B. Veklerov, ?On a controlled queueing system,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 101?105 (1967).
[87] O. I. Bronshtein, A. L. Raikin, and V. V. Rykov, ?On a single-queue service system with losses,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 45?51 (1965).
[88] O. I. Bronshtein and V. V. Rybakov, ?Optimal priorities in queueing systems,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6, 28?37 (1965).
[89] O. I. Bronshtein and V. V. Rybakov, ?Optimal priorities in queueing systems,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6, 28?37 (1965).
[90] E. V. Bulinskaya, ?Stationary solution in optimal storage-control problems,? Teor. Veroyat. i Prim.,9, No. 3, 556?560 (1964).
[91] N. P. Buslenko, Modeling of Complex Systems [in Russian], Nauka, Moscow (1968), 355 pages.
[92] N. P. Buslenko and I. N. Kovalenko, ?Mathematical description of the elements of complex systems,? Dokl. Akad. Nauk SSSR,187, No. 6, 1222?1224 (1969). · Zbl 0193.19803
[93] N. P. Buslenko and A. P. Cherenkov, ?Application of queueing-theoretic methods in operations research,? Progress in Mathematics, Vol. 11, Plenum Press, New York-London (1971), pp. 77?124. · Zbl 0243.60054
[94] Tsu-k’un Wang, ?Some properties of recurrent Markov processes,? Acta Math. Sinica,16, No. 2, 166?178 (1966).
[95] Van’an’ and I. I. Ézhov, ?A one-parameter system of characteristic functions specified by differential equations,? Dopovidi AN Ukr. RSR,A, No. 6, 490?492 (1969).
[96] P. I. Vasil’ev ?Palm-Khinchin limit functions,? Uch. Zap. Kishinev. Univ.,70, 52?61 (1964).
[97] P. I. Vasil’ev, ?On the orderliness of a stationary point process,? Uch. Zap. Kishinev. Univ.,82, 44?48 (1965).
[98] P. I. Vasil’ev, ?On a class of stationary point processes,? Uch. Zap. Kishinev. Univ.,82, 49?55 (1965).
[99] P. I. Vasil’ev, ?General form of a Palm process,? Uch. Zap. Kishinev. Univ.,91, 30?38 (1967).
[100] P. I. Vasil’ev and I. N. Kovalenko, ?Remark on stationary point processes,? Ukrainsk. Matem. Zh.,16, No. 3, 374?382 (1964). · Zbl 0156.18603 · doi:10.1007/BF02538014
[101] Yu. A. Vasil’ev and B. A. Kozlov, ?The standby system as an aging system,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 33?36.
[102] Yu. A. Vasil’ev and B. A. Kozlov, ?Influence of the form of the repair-time distribution on the reliability of a standby duplicate system,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 37?45.
[103] E. B. Veklerov, ?Optimal preemptive discretionary priorities in queueing systems,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 2, 87?90 (1967).
[104] P. I. Veleva, ?Determination of the optimal input process for a particular queueing system,? Mathematical Aspects of Industrial Control [in Russian], No. 2, Moskov, Univ., Moscow (1970), pp. 158?164.
[105] N. O. Vil’chevskii and V. G. Kukekov, ?The service problem for uniform traffic through a linear two-stage queueing system,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 263?270.
[106] O. P. Vinogradov, ?Limiting distributions for the first input-loss time in a single-queue bulk-service system with finite waiting space,? Matem. Zametki,3, No. 5, 541?546 (1968).
[107] O. P. Vinogradov, ?Distribution of the queue-length maximum in a single-queue bulk-service system,? Izv. Akad. Nauk Arm. SSR, Matematika,3, No. 3, 257?262 (1968).
[108] O. P. Vinogradov, ?Distribution of the queue-length maximum and its application,? Teor. Veroyat. i Prim.,13, No. 2, 366?375 (1968).
[109] O. V. Viskov, ?Two asymptotic equations for queueing theory,? Teor. Veroyat. i Prim.,9, No. 1, 177?178 (1964). · Zbl 0154.43501
[110] O. V. Viskov, ?Waiting time in a mixed queueing system,? Trudy Matem. Inst. Akad. Nauk SSSR,71, 26?34 (1964).
[111] O. V. Viskov, ?On a queueing system having a Markov dependence between inputs,? [in Russian], Trans. Fourth Prague Conf. Information Theory, Statistical Decision Functions, and Random Processes, 1965, Prague (1967), pp. 627?634.
[112] O. V. Viskov and A. I. Ismailov, Izv. Akad. Nauk Uz. SSSR, Ser. Fiz.-Mat. Nauk, No. 3, 68?69 (1970).
[113] O. V. Viskov and Yu. V. Prokhorov, ?Input-loss probability for high-intensity traffic,? Teor. Veroyat. i Prim.,9, No. 1, 99?104 (1964).
[114] V. Vladimirov and V. Matveev, ?A queueing system with preferential priority and ?warmup,?? Collected Papers of Moscow State University Computing Center [in Russian], Vol. 6 (1967), pp. 259?271.
[115] N. M. Borob’ev, ?On linear Markov random processes,? Fifth Varsity Conf. Physical and Mathematical Modeling [in Russian], Moscow (1968), pp. 48?56.
[116] A. L. Garkavi and V. B. Gogolevskii, ?Determination of mean failure-free operating time of standby equipments with a monitoring and automatic switching device,? Avtomat. i Telemekhan.,25, No. 5, 906?914 (1965).
[117] I. Gergei, ?A single-server queueing system with ?warmup,?? Computing Methods and Programming [in Russian], No. 9, Moskov. Univ., Moscow (1967), pp. 99?107.
[118] T. Gergei, I. I. Ezhov, and I. N. Tsukanov, ?Markov chains controlled by a complex renewal process,? Proc. Seminar: Optimal Decision Theory [in Russian], No. 1, Kiev (1969), pp. 93?109.
[119] I. B. Gertsbakh, Preventive Maintenance Models (Theoretical Principles of Preventive Maintenance Planning) [in Russian], Sov. Radio, Moscow (1969), 214 pages.
[120] A. M. Gersht, ?A queueing problem with aftereffect,? Probl. Peredachi Inform.,3, No. 3, 53?58 (1967).
[121] B. V. Gnedenko, ?On standby duplication,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 3?12 (1964).
[122] B. V. Gnedenko, ?Duplication with repair,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 111?118 (1964).
[123] B. V. Gnedenko, ?Repair efficiency of standby equipments,? Limit Theorems and Statistical Interences [in Russian], Fan, Tashkent (1966), pp. 46?59.
[124] B. V. Gnedenko, ?Relationship of the summation of independent stochastic variables to queueing and reliability problems,? Rev. Roumaine Math. Pures Pures et Appli.,12, No. 9, 1243?1253 (1967).
[125] B. V. Gnedenko, Yu. K. Belyaev, and I. N. Kovalenko, ?Mathematical aspects of reliability theory,? Probability Theory, Mathematical Statistics, and Theoretical Cybernetics 1964 [in Russian] (Itogi Nauki), VINITI AN SSSR, Moscow (1966), pp. 7?53.
[126] B. V. Gnedenko and I. N. Kovalenko, ?Some problems in queueing theory,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 88?100 (1967).
[127] B. V. Gnedenko and I. N. Kovalenko, Introduction to Queueing Theory [in Russian], Nauka, Moscow, (1966), 431 pages. · Zbl 0186.24502
[128] B. V. Gnedenko, B. A. Kozlov, and I. A. Ushakov, ?On the role and status of reliability theory in the synthesis of complex systems,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 14?32.
[129] B. V. Gnedenko and B. Fraier, ?Remarks on a paper by I. N. Kovalenko,? Liet. Mat. Rinkinys. (Lit. Matem. Sborn.),9, No. 3, 463?470 (1969).
[130] V. B. Gogolevskii, ?On the reliability of elements subject to aging,? Avtomat. i Telemekhan.,24, No. 3, 383?392 (1963).
[131] A. M. Gorlin and A. E. Lobovskii, ?Problems of choosing the optimal service mode for an automatic system,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3, 79?85 (1967).
[132] V. P. Grabovetskii, ?Reliability of standby groups, taking spares into account,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 121?127.
[133] B. I. Grigelionis, ?Convergence of the sums of stepped stochastic processes to Poisson processes,? Teor. Veroyat. i Prim.,8, No. 2, 189?194 (1963).
[134] B. I. Grigelionis, ?Error of approximation of a superposition of renewal processes by a Poisson process,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),2, No. 2, 135?143 (1963).
[135] B. I. Grigelionis, ?Refinement of the multivariate limit theorem on convergence to a Poisson law,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),2, No. 2, 127?133 (1963).
[136] B. I. Grigelionis, ?Central limit theorem for superpositions of renewal processes,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),4, No. 2, 197?201 (1964). · Zbl 0203.19202
[137] B. I. Gribelionis, ?Limit theorems for superpositions of renewal processes,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 246?266.
[138] B. I. Grigelionis, ?On the convergence of superpositions of stepped stochastic processes to a Poisson process,? Iiet. Matem. Rinkinys. (Lit. Matem. Sborn.),6, No. 2, 241?244 (1966).
[139] A. L. Grigor’ev and I. A. Bol’shakov, ?Separation from noise of pulse sequences with finite aftereffect, III: Overlapping pulses,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 1, 111?123 (1969).
[140] É. Ya. Grinberg and G. L. Ionin, ?Estimate of the maximum loss difference in the transposition of two servers,? Latvian Mathematical Yearbook [in Russian], Vol. 2, Riga (1966), pp. 71?78.
[141] É. Ya. Grinberg and M. A. Shneps, ?Certain properties of the loss stream of a telephone message,? Zinatn. Raksti. Latv. Univ. (Uch. Zap. Latv. Univ.),47, 253?260 (1963).
[142] Kh. G. Gulyamov, ?Optimization of the reliability of communication system elements,? Fourth Conf. Information Transmission and Encoding Theory [in Russian], Sec. 5, Moscow-Tashkent (1969), pp. 52?54.
[143] V. E. Gumenyuk, ?Problems in the investigation of a single-channel two-priority system with waiting, uninterrupted service, and an unreliable server,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 240?252.
[144] D. V. Gusak, ?Canonic and infinitely divisible factorization,? Dopovidi Akad. Nauk Ukr. RSR,A, No. 4, 294?298 (1969).
[145] Yu. V. Gusev, ?Certain problems in mathematical queueing theory,? Izv. Kuibyshev. Sel’skokhozyaist. Inst.,15, 220?233 (1964).
[146] Yu. V. Gusev, ?Servicing a nonorderly Poisson input process (system with waiting),? Izv. Kuibyshev. Sel’skokhozyaist. Inst.,18, 116?118 (1966).
[147] Yu. V. Gusev, ?Multiserver systems with standard service time,? Iav. Kuibyshev. Sel’skokhozyaist. Inst.,19, 157?160 (1967).
[148] É. A. Danielyan, ?Single-queue stochastic systems with priority,? Collected Papers of Moscow State University Computing Center, Statistics and Stochastic Systems Series [in Russian], No. 7 (1969).
[149] É. A. Danielyan and Yu. M. Langer, ?A queueing system with nonpreemptive priority and one unreliable server,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 2, 85?90 (1970).
[150] B. A. Degtyarev, ?Functional efficiency criteria for prolonged-operation multichannel systems,? Avtomat. i Telemekhan.,26, No. 2, 333?341 (1965).
[151] E. K. Degtyarev, ?Stochastic models of the operation of asynchronous digital computers,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 2, 91?103 (1967).
[152] A. Deeva and G. Klimov, ?Multichannel priority queueing (recurrent input process and exponential service time),? Collected Papers of Moscow State University Computing Center [in Russian], No. 6 (1967), pp. 282?285.
[153] A. Deeva, G. Klimov, and L. Kharina, ?Second-order simulation in application to queueing systems,? Collected Papers of Moscow State University Computing Center [in Russian], No. 3, 409?417 (1965).
[154] K. K. Dzhansentov, ?The erythron from the point of view of a multiserver queueing system,? Izv. Sibirsk. Otd. Akad. Nauk SSSR, Part 15: Ser. Biol. Nauk, No. 3, 61?67 (1969).
[155] V. Dimiev and P. Pavlov, ?A particular two-channel queueing system with allowance for idle time,? Godishnik Vyssh. Tekh. Ucheni Zaved. Matem.,3, No. 1, 127?131 (1966?67).
[156] B. N. Dimitrov and É. A. Danielyan, ?Several limit theorems in reliability and queueing theory,? Mathematical Aspects of Industrial Control [in Russian], No. 2, Moskov. Univ., Moscow (1970), pp. 179?183.
[157] E. F. Domanovskaya, ?Duplication of a system with repairable and unrepairable elements,? Uch. Zap. Leningrad Univ., No. 68, 152?156 (1969).
[158] S. N. Dranitsyn, ?Preferential servicing of queueing processes with a finite number of inputs,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 1, 100?104 (1970).
[159] I. M. Dukhovnyi, ?A single-server queueing system with alternation of priorities,? Probl. Peredachi Inform.,5, No. 2, 61?71 (1969).
[160] I. M. Dukhovnyi, ?On the single-server system with alternating priorities and ?warmup,?? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 66?74 (1969).
[161] I. M. Dukhovnyi, ?Optimal priorities in a completely accessible system with finite waiting space,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 252?257.
[162] I. I. Ezhov, ?On a problem of Takác’s,? Visnik Kiivs’k. Univ., Part 5: Ser. Matem. Mekh., No. 2, 161?163 (1962).
[163] I. I. Ezhov, ?On the GI|M|m queueing system with nonorderly input process,? Dopovidi Akad. Nauk Ukr. RSR, No. 8, 988?990 (1965).
[164] I. I. Ezhov, ?Ergodic theorem for Markov processes describing general queueing systems,? Kibernetika, No. 5, 79?81 (1966).
[165] I. I. Ezhov, ?Distribution of the maximum for a class of stochastic processes with step-function paths,? Trudy Inst. Prikl. Matem. Tbilissk. Univ., No. 2, 207?214 (1969).
[166] I. I. Ezhov, ?Distribution of the jump at a given level by a sequence of maxima of stochastic variables controlled by a Markov chain, Ukrainsk. Matem. Zh.,21, No. 6, 831?836 (1969).
[167] I. I. Ezhov, ?Distribution of the queue-length minimum in a GI|G|1 system,? Mathematical Methods of Quality Control and Reliability [in Russian], Fan, Tashkent (1969), pp. 58?69.
[168] I. I. Ezhov, T. Gergei, and I. N. Tsukanov, ?Sojourn time of a Markov chain controlled by a complex renewal process in a given domain,? Proc. Seminar: Optimal Decision Theory [in Russian], No. 2, Kiev (1969), pp. 99?108.
[169] I. I. Ezhov and M. I. Radrenko, ?Certain lifetime distributions for a random failure rate,? Avtomat. i Vychisl. Tekh., No. 4, 55?57 (1967).
[170] V. A. Emelichev and V. I. Komlik, ?On the reliability problem,? Izv. Akad. Nauk Beloruss. SSR, Ser. Fiz.-Matem. Nauk, No. 5, 119?121 (1968). · Zbl 0196.23303
[171] G. V. Emel’yanov, ?Queueing systems with servers subject to breakdown and repair,? Probl. Peredachi Inform.,3, No. 3, 59?63 (1967).
[172] S. V. Zhak, ?Two-dimensional birth-and-death process equations,? Mathematical Analysis and Its Applications [in Russian], Rostov. Univ., Rostov-on-Don (1969), pp. 83?90.
[173] V. G. Zhivoglyadov and A. V. Martynov, ?A méthod for engineering calculations of the carrying capacity of uncontrollable heterogeneous automobile- and streetcar-traffic intersections,? Application of Computer Mathematics and Computer Engineering Methods to the Solution of Scientific-Research and National-Economic Problems [in Russian], No. 4, Voronez (1969), pp. 96?105.
[174] I. S. Zhitomirskii, ?On the distribution of the first departure time,? Teor. Veroyat. i Prim.,8, No. 2, 156?166 (1963).
[175] P. I. Zhuk, ?A transformation of the generalized Erlang equations,? Kibernetika, No. 4, 146?147 (1969).
[176] G. P. Zakharov, A. V. Nebeev, and V. P. Revel’s, ?One-channel communication systems,? Probl. Peredachi Inform.,6, No. 3, 92?95 (1970).
[177] M. D. Zbyrko, ?Reliability of Cybernetic Systems [in Russian], No. 2, Kiev (1968?69), pp. 121?130.
[178] V. M. Zolotarev, ?Distribution of queue-length and the number of busy servers in an Erlangian-type system with random server breakdowns and regenerations,? Trudy Matem. Inst. Akad. Nauk SSSR,71, 51?61 (1964).
[179] A. F. Zubova, ?On cold replication with repairs,? Avtomat. i Telemekhan.,26, No. 10, 1800?1808 (1965).
[180] R. P. Zyablov, ?Determination of the service period of a remote control system. Avtomat. i Telemekhan., No. 4, 162?167 (1966).
[181] V. I. Ivanenko and V. S. Korolyuk, ?A method for the synthesis of optimal automatic control systems,? Kibernetika, No. 2, 98?101 (1965).
[182] V. A. Ivnitskii, ?A problem in composition theory with orientation,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 153?159.
[183] V. A. Ivnitskii, ?Asymptotic investigation of the probabilistic characteristics of a generalized single-server system,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),5, No. 4, 531?540 (1965).
[184] V. A. Ivnitskii, ?Asymptotic investigation of a stationary queue in the case of a generalized input process,? Kibernetika, No. 5, 60?65 (1965). · Zbl 0143.20404
[185] V. A. Ivnitskii, ?A queueing system with an unreliable server,? Avtomat. i Telemekhan., No. 5, 91?102 (1966).
[186] V. A. Ivnitskii, ?Single-server system with a random-intensity input process service rate,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),6, No. 1, 41?50 (1966).
[187] V. A. Ivnitskii, ?Allowance for the possibility of breakdown and repair of a single-server queueing system,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 64?74 (1966).
[188] V. A. Ivnitskii, ?Algorithmic approach to the determination of the stationary distribution of state probabilities of a class of single-server queueing systems (without memory),? Proc. Seminar: Complex Systems and Simulation [in Russian], No. 1, Kiev (1968), pp. 38?48.
[189] V. A. Ivnitskii, ?Reconstruction, based on observations of the output process, of the characteristics of a single-server system with finite service time,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3, 60?65 (1969).
[190] V. A. Ivnitskii, ?A symptotic investigation of the stationary distribution of state probabilities of a class of single-server queueing systems (without memory), Probl. Peredachi Inform.,5, No. 3, 88?95 (1969).
[191] V. A. Ivnitskii, ?Nonstationary queue-length distribution of a single-server queueing system,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),9, No. 2, 281?290 (1969). · Zbl 0208.22601
[192] V. A. Ivnitskii, ?Nonstationary queue-length and waiting-time distributions of a single-server queueing system,? Ukrainsk. Matem. Zh.,22, No. 4, 549?556 (1970).
[193] V. A. Ivnitskii, ?Reconstruction of the characteristics of a single-server system of finite queue length on the basis of output observations,? Proc. First All-Union Sympos. Statistical Problems in Engineering Cybernetics [in Russian], Nauka (1971), p. 3.
[194] Dzh. K. Iglson, ?Canonic decompositions of birth-and-death processes,? Teor. Veroyat. i Prim.,14, No. 2, 217?225 (1969).
[195] G. L. Ionin, ?Optimal losses in the case of a nonorderly input process,? Probl. Peredachi Inform.,2, No. 3, 100?101 (1966).
[196] G. L. Ionin and Ya. Ya. Rachevskii, ?Calculation of the loss probabilities in networks composed of completely accessible clusters,? Probl. Peredachi Inform.,2, No. 2, 79?82 (1966).
[197] G. L. Ionin, Ya. Ya. Sedol, and T. Ya. Rozitis, ?Study of searching for an idle server in systems with losses,? Latvian Mathematical Yearbook [in Russian], Vol. 6 (1969), pp. 65?80.
[198] G. L. Ionin and M. A. Shneps, ?Optimal allocation of servers of varying efficiences,? Latvian Mathematical Yearbook [in Russian], Vol. 2, Riga (1966), pp. 95?98.
[199] G. L. Ionin and M. A. Shneps, ?Statistical equivalence of time and number-of-input estimates in queueing systems,? Latvian Mathematical Yearbook [in Russian], Vol. 2, Riga (1966), pp. 99?102. · Zbl 0202.48203
[200] A. I. Ismailov, ?Busy-period distribution in a particular queueing model,? Dokl. Akad. Nauk Uz. SSR, No. 5, 3?4 (1970).
[201] A. I. Ismailov, ?Distribution of the busy period of a mixed queueing system,? Large Systems, Queueing, and Reliability [in Russian], Nauka, Moscow (1970), pp. 305?312.
[202] V. V. Kalashnikov, ?A queueing system with ?intervals of inaccessibility,?? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6, 57?63 (1966).
[203] V. V. Kalashnikov, ?Application of Lyapunov’s method to the solution of certain queueing problems,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 89?95 (1968).
[204] V. V. Kalashnikov, ?A queueing model,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 1, 88?90 (1968).
[205] V. V. Kalashnikov, ?Reliability evaluation of standby systems with constant repair time by an analog of Lyapunov’s method,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3, 76?81 (1969).
[206] V. V. Kalashnikov, ?Reliability analysis by Lyapunov’s method,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 2, 65?76 (1970).
[207] V. V. Kalashnikov, ?Investigation and estimation of the characteristics of a queueing system by analogs of the direct method of Lyapunov,? Large systems, Queueing, and Reliability [in Russian], Nauka, Moscow (1970), pp. 209?218.
[208] B. Kaminskene, ?Central limit theorem for superpositions of discrete renewal processes,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),9, No. 3, 497?514 (1969).
[209] G. D. Kartashov, ?Some probabilistic problems in reliability theory in the presence of constraints,? Teor. Veroyat. i Prim.,14, No. 4, 623?638 (1969).
[210] V. A. Kasparson, ?Servicing a Poisson input process of random intensity,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6, 52?57 (1969).
[211] I. Kerstan and K. Mattes, ?Generalization of the Palm-Khinchin theorem,? Ukrainsk. Matem. Zh.,17, No. 4, 29?36 (1965). · Zbl 0149.13801 · doi:10.1007/BF02526563
[212] B. K. Kirpichnikov, ?On the selection and formulation of reliability criteria for a repairable device,? Uch. Zap. Leningrad. Gos. Univ., No. 68, 135?145 (1969).
[213] V. V. Kiryukhin, ?Calculating the reliability of multicomponent systems,? Trudy Sibirsk. Fiz.-Tekh. Inst. Tomsk. Univ., No. 44, 153?159 (1964).
[214] G. P. Klimov, ?Extremal problems in queueing theory,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), 310?325.
[215] G. P. Klimov, ?Determination of the transfer probabilities of the number of telephone calls,? Collected Papers of Moscow State University Computing Center [in Russian], No. 3 (1965), pp. 428?433.
[216] G. P. Klimov, ?Reliability of an n-unit standby system,? Collected Papers of Moscow State University Computing Center [in Russian], No. 3 (1965), pp. 434?440.
[217] G. P. Klimov, ?Certain aspects of multiphase queueing,? Computing Methods and Programming [in Russian], No. 9, Moskov. Univ. Moscow (1967), pp. 111?116.
[218] G. P. Klimov and V. I. Kurilov, ?Simulation of a class of queueing systems,? Collected Papers of Moscow State University Computing Center [in Russian], No. 3 (1965), pp. 398?408.
[219] G. P. Klimov and L. Kharina, ?Inverted queueing order with priorities,? Collected Papers of Moscow State University Computing Center [in Russian], No. 6 (1967), pp. 272?278.
[220] G. P. Klimov and L. S. Frank, ?Generalization of the Palm theorem,? Collected Papers of Moscow State University Computing Center [in Russian], No. 3 (1965), pp. 418?427.
[221] G. P. Klimov and L. S. Frank, ?Synthesis of a stationary point process with finite aftereffect,? Teor. Beroyat. i Prim.,12, No. 1 134?141 (1967).
[222] E. Z. Klimova, ?Study of the single-server queueing system with ?warmup,?? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 1, 91?97 (1968).
[223] L. M. Kovaleva, ?On the sojourn time of an elementary semi-Markov system in a given state,? Probability Theory and Mathematical Statistics (Inderdepartmental Scientific Collection) [in Russian], No. 1 (1970), pp. 100?108. · Zbl 0223.60037
[224] I. N. Kovalenko, ?On a special method in queueing theory? (abstract), Proc. Sixth All-Union Conf. Probability Theory and Mathematical Statistics, Vil’nyus, 1960 [in Russian], Gos. Izd. Polit. i Nauch Lit. LitSSR (1962), pp. 357?358.
[225] I. N. Kovalenko, ?Aspects of reliability theory for complex systems,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 194?205.
[226] I. N. Kovalenko, ?Reconstruction of the characteristics of a system on the basis of observations of the output process,? Dokl. Akad. Nauk SSSR,164, No. 5, 979?981 (1965). · Zbl 0138.11604
[227] I. N. Kovalenko, ?Some analytic methods in queueing theory,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 325?338.
[228] I. N. Kovalenko, ?On a class of limiting distributions for a sequence of series of superpositions of independent renewal processes,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),5, No. 4, 561?568 (1965).
[229] I. N. Kovalenko, ?On a class of limiting distributions for rarefactions of homogeneous events,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),5, No. 4, 569?573 (1965).
[230] I. N. Kovalenko, ?A problem associated with optimal information processing by a queueing system,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 75?79 (1968).
[231] I. N. Kovalenko, ?Queueing theory,? Probability Theory 1963 [in Russian] (Itogi Nauki), VINITI AN SSSR, Moscow (1965).
[232] I. N. Kovalenko and O. M. Yurkevich, ?New results in the theory of queueing systems with constraints,? Probability Theory and Mathematical Statistics (Interdepartmental Scientific Collection) [in Russian], No. 2 (1970), pp. 98?103.
[233] V. A. Kokotushkin and V. G. Mikhalev, ?Servicing a completely accessible cluster of several input processes with nonpreemptive service priority and a finite common queue,? Probl. Peredachi Inform.,5, No. 2, 53?60 (1969).
[234] L. V. Kolomenskii, ?On the readiness factor of complex systems,? Avtomat. i Vychisl. Tekh., No. 2, 62?65 (1970).
[235] V. V. Konyukhovskii, Stochastic Processes and Certain Queue ing-Theoretic Problems [in Russian], Moskov. Univ., Moscow (1968); Knizhnaya Letopis’, Nos. 13?14 (1969).
[236] B. M. Kopelevich, ?Preventive maintenance of standby redundant systems,? Avtomat. i Vychisl. Tekh., No. 5, 49?55 (1969).
[237] M. T. Korniichuk, ?On a queueing problem with allowance for reliability,? Ukrainsk. Matem. Zh.,22, No. 3, 384?393, 393?402 (1970).
[238] V. S. Korolyuk, ?Semi-Markov processes in reliability problems,? Mathematical Methods in Quality Control and Reliability [in Russian], Fan, Tashkent (1969), pp. 51?57.
[239] V. S. Korolyuk, ?Asymptotic behavior of the sojourn time of a semi-Markov process in a subset of states,? Ukrainsk. Matem. Zh.,21, No. 6, 842?845 (1969).
[240] V. S. Korolyuk, L. I. Polishchuk, and A. A. Tomusyak, ?A limit theorem for semi-Markov processes,? Kibernetika, No. 4, 144?145 (1969).
[241] V. S. Korolyuk and E. P. Tkachenko, ?Sojourn time of a Poisson process in a band with a retarding screen,? Dopovidi Akad. Nauk Ukr. RSR,A, No. 6, 513?516 (1969).
[242] V. S. Korolyuk and E. P. Tkachenko, ?Asymptotic calculation of generating functions for the sojourn time of a Poisson process in a band with a retarding screen,? Dopovidi Akad. Nauk Ukr. RSR,A, No. 4, 315?317 (1970).
[243] V. S. Korolyuk and A. F. Turbin, ?Asymptotic behavior of the sojourn time of a semi-Markov process in a reducible subset of states,? Probability Theory and Mathematical Statistics (Interdepartmental Scientific Collection), [in Russian], No. 2 (1970), pp. 133?143.
[244] E. S. Kochetkov, ?Calculation of the reliability of repairable systems, taking repair time into account,? Avtomat. i Telemekhan.,25, No. 5, 891?897 (1965).
[245] E. S. Kochetkov, ?Analysis of repairable detection systems,? Avtomat. i Telemekhan.,26, No. 8, 1410?1417 (1965).
[246] L. V. Kochnev and V. Z. Yapol’skii, ?Solution of the optimization problem for the structural parameters of complex service systems,? Cybernetics and the University [in Russian], No. 3, Tomsk. Univ., Tomsk (1970), pp. 86?96.
[247] B. P. Kredentser, ?Optimal intensity of a two-priority queueing system with waiting,? Avtomat. i Telemekhan., No. 9, 145?150 (1970).
[248] B. Kuprite, ?Central limit theorem for superpositions of discrete renewal processes,? Liet Matem. Rinkinys. (Lit. Matem. Sborn.),9, No. 2, 407?408 (1969).
[249] T. K. Kukhta, ?Determination of loss probability by means of semi-Markov processes,? Proc. Seminar: Complex Systems and Simulation [in Russian], No. 1, Kiev (1968), pp. 67?73.
[250] N. L. Lazrieva, ?Model of the storage problem with a controllable input process,? Trudy Inst. Prikl. Matem. Tbilissk. Univ.,1, 227?233 (1969).
[251] E. P. Lebedintseva, ?Distribution of the loss cost function in control and preventive maintenance problems,? Kibernetika, No. 5, 118?121 (1969).
[252] B. R. Levin, ?Some generalizations in the theory of pulsed stochastic processes,? Élektrosvyaz’, No. 7, 21?32 (1963).
[253] V. I. Levin, ?Probabilistic analysis of composite networks and their reliability,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6, 85?90 (1964).
[254] L. P. Leont’ev, ?Determination of the optimal coupling mode between main and standby elements,? Trudy Inst. Élektron. i Vychisl. Tekh. Akad. Nauk Latv. SSR,5, 218?223 (1963).
[255] Zh. B. Linkovskii, ?Calculation of the resumption of operation of multipurpose systems in reliability theory,? Izv. VUZov, Élektromekhanika, No. 3, 354?355 (1965).
[256] V. S. Luk’yanov and L. N. Sapegin, ?A queueing system with superposition of requests,? Avtomat. i Vychisl. Tekh., No. 1, 55?61 (1969).
[257] L. A. Lyusternik, ?On a problem in queueing theory and the related generalization of cylindrical functions,? Dokl. Akad. Nauk SSSR,777, No. 5, 1005?1007 (1967).
[258] L. A. Lyusternik ?A problem in queueing theory,? Mathematical Aspects of Industrial Control [in Russian], No. 1, Moscow (1969), pp. 5?17.
[259] E. D. Maiboroda and V. P. Medvedev, ?Derivation of Erlang-type equations for an n-server discrete queueing with constant service time,? Proc. Seminar: Complex Systems and Simulation [in Russian], No. 1, Kiev (1968), pp. 49?61.
[260] V. F. Maksimenko and I. M. Lyashenko, ?An algorithm for the coupling of several queueing networks,? Computational Mathematics and Engineering [in Ukrainian], Akad. Nauk Ukr. RSR, Kiev (1963), pp. 66?76.
[261] A. V. Malishevskii, ?Global estimates for chain systems (I),? Avtomat. i Telemekhan., No. 4, 72?80 (1970).
[262] V. A. Malyshev, ?Analytic method in the theory of random walks in the quarter-plane; simple walk with oblique reflection,? Soviet Japanese Symposium on Probability Theory, 1969 [in Russian], Part I, Novosibirsk (1969), pp. 176?184.
[263] N. I. Mal’tseva, ?Approximation of continuous distributions by a mixture of Erlang distribution,? Probl. Peredachi Inform.,6, No. 3, 89?92 (1970).
[264] Kh. Sh. Margulus, ?On the ?pair process,?? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 266?273.
[265] I. B. Marno ?On the cyclicity of optimal control in the preventive maintenance problem,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 38?43 (1969).
[266] A. B. Markhasin, ?Properties of a class of nonstationary stochastic processes with aftereffect,? Large Systems, Queueing, and Reliability [in Russian], Nauka, Moscow (1970), pp. 326?337 (1970).
[267] T. P. Mar’yanovich, ?Aspects of the reliability of standby systems,? Ukrainsk. Matem. Zh.,15, No. 2, 145?157 (1963). · Zbl 0127.10001 · doi:10.1007/BF02537430
[268] V. F. Matveev, ?The single-server priority queueing system,? Mathematical Aspects of Industrial Control [in Russian], No. 2, Moskov. Univ., Moscow (1970), pp. 199?230.
[269] M. V. Meleshina, ?An automaton model for the organization of customer interaction in a queueing system with waiting,? Avtomat. i Telemekhan., No. 5, 148?150 (1969).
[270] G. G. Men’shikov, ?Asymptotic expressions for the mean time of failure-free operation,? Kibernetika, No. 1, 44?50 (1967).
[271] D. G. Mikhalev, ?A single-server queueing system with finite waiting time, several input streams, and arbitrary service time,? Probl. Peredachi Inform.,6, No. 1, 87?96 (1970).
[272] D. G. Mikhalev, ?Standby redundancy with priority in data-transmission systems,? Large Systems, Queueing, and Reliability [in Russian], Nauka, Moscow (1960), pp. 267?277.
[273] S. A. Molchanov, ?Boundary-value theory for sums of independent identically distributed stochastic variables,? Vest. Moskov. Univ. Matem. Mekhan., No. 6, 3?10 (1969).
[274] É. M. Musaev and A. Ch. Tagyev, ?Solution of certain problems in queueing theory,? Sci. Conf. Junior Scientists and Graduate Students of Acad. Sci. Azerbaidzhan SSR, Ser. Engng. Phys. Math. Sci. [in Russian], AN AzerbSSR, Baku (1966), pp. 91?96.
[275] N. M. Mukhitdinova, ?On a problem in redundancy theory,? Dokl. Akad. Nauk UzSSR, No. 5, 3?5 (1969).
[276] N. M. Mukhitdinova, ?Investigations of facilitated redundancy with renewal,? Izv. Akad. Nauk Uz. SSR, Ser. Fiz.-Matem. Nauk, No. 1, 22?28 (1970).
[277] Gisaku Nakamura and Yo Murao, Analysis of queues with batched service,? Electr. Commun. Lab. Tech. J.,17, No. 8, 1599?1618 (1968).
[278] T. I. Nasirova, ?On a generalization of the Erlang problem,? Trudy Vychisl. Tsentra Akad. Nauk AzerbSSR,2, 3?13 (1968).
[279] A. A. Natan, ?Statistical selection of inputs in queueing with finite queue length,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3, 54?56 (1966).
[280] A. A. Natan and B. I. Petrin ?Statistical filtering of requests in a queueing system with priority feedback,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 54?61 (1969).
[281] V. V. Naumchenko, ?On the reliability of ideal standby redundant systems,? Avtomat. i Telemekhan.,25, No. 3, 413?415 (1964).
[282] V. B. Nevzorov and V. V. Petrov, ?Distribution of the maximum of sequential sums of independent stochastic variables,? Teor. Veroyat. i Prim.,14, No. 4, 708?715 (1969).
[283] B. V. Nemchinov, A simple proof of Palm’s hypothesis,? Computational Methods and Programming [in Russian], No. 9, Moskov. Univ., Moscow (1967), pp. 108?110.
[284] T. N. Nesterova, Estimate of the required storage volume for the batched processing of data transmitted by dependent Poisson sources,? Avtomat. i Telemekhan., No. 9, 92?97 (1969). · Zbl 0195.18102
[285] A. Obretenov, B. Dimitrov, and M. Uzunov, ?Reliability analysis of a system in terms of stochastic processes,? Izv. Matem. Inst. B”lg. Akad. Nauk,11, 159?180 (1970).
[286] L. V. Perfil’ev, ?An algorithm for the modeling of a class of queueing systems,? Izv. Tomsk. Politekh. Inst.,211, 91?96 (1970).
[287] P. G. Petrov, ?Steady-state waiting-time distribution for a queueing system with ?warmup,?? Computational Methods and Programming [in Russian], No. 9, Moskov. Univ., Moscow (1967), pp. 117?130.
[288] B. G. Pittel’ and V. P. Fedorov, ?A mathematical model for the prediction of passenger traffic in an urban transportation network,? Ékonom. i Matem. Metody,5, No. 5, 744?757 (1969).
[289] I. B. Pogozhev, ?Estimation of the deviations of the stream of failures in multipurpose equipment from a Poisson process,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 228?246.
[290] D. G. Polyak, ?Problems in the theory of multiserver queueing systems with constant waiting time,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 2, 94?102 (1968).
[291] D. G. Polyak, ?Calculation of the reliability of repairable systems with regard for changing work shifts of repair personnel,? Avtomat. i Telemekhan., No. 12, 103?109 (1968).
[292] D. G. Polyak, ?Influence of the transient period on the accuracy of statistical modeling of a particular queueing system,? Probl. Peredachi Inform.,5, No. 4, 89?93 (1969).
[293] D. G. Polyak, ?An approach to the analysis of queueing systems,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 288?289.
[294] N. A. Pravotorova, ?Determining the optimal service discipline in a system with diverse finite sources,? Theory and Means of Automation [in Russian], Nauka, Moscow (1968), pp. 199?204.
[295] É. L. Presman, ?Sojourn time of a particular system in a defective state,? Trudy Matem. Inst. Akad. Nauk SSSR,71, 78?81 (1964).
[296] É. L. Presman, ?Waiting time in a multiserver queueing system,? Teor. Veroyat. i Prim.,10, No. 1, 70?81 (1965).
[297] É. L. Presman, ?Factorization methods and the boundary-value problem for sums of stochastic variables defined on a Markov chain,? Izv. Akad. Nauk SSSR, Ser. Matem.,33, No. 4, 861?900 (1969).
[298] Yu. V. Prokhorov, ?Control of a Wiener process for a finite number of switchings,? Trudy Matem. Inst. Akad. Nauk SSSR,71, 82?87 (1964).
[299] Yu. V. Prokhorov, ?Transient effects in queueing processes (I),? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),3, No. 1, 199?205 (1963).
[300] B. S. Razumikhin, ?A queueing problem,? Avtomat. i Telemekhan., No. 4, 116?120 (1970).
[301] A. L. Raikin, A. F. Rubtsov, and V. S. Penin, ?On the reliability of engineering systems with a regularly regenerable standby,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 13?18 (1964).
[302] A. I. Ressin, ?Reliability criteria for nonstationary and stationary linear Automatic Control Systems,? Izv. Akad. Nauk SSSR, Otd. Tekh. i. Tekh. Kibernetika, No. 3, 39?44 (1963). · Zbl 0127.35003
[303] N. I. Ringo, ?A variational problem arising in the solution of the equipment replacement problem,? Proc. Seminar: Optimal Decision Theory [in Russian], No. 3, Kiev (1969), pp. 54?65.
[304] B. A. Rigozin, ?Some extremal problems in queueing theory,? Teor. Veroyat. i Prim.,11, No. 1, 161?169 (1966).
[305] D. V. Rozhdestvenskii and G. N. Fanarzhi, ?Reliability of a duplicate standby system with repair and preventive maintenance,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3, 61?66 (1970).
[306] V. Ya. Rozenberg and A. I. Prokhorov, Queueing Theory: What Is It? (2nd ed.) [in Russian], Sov. Radio, Moscow (1965).
[307] A. L. Rozovskii, ?The output process in a system with infinitely many servers,? Seminar on Cybernetics, Acad. Sci. Moldavian SSR, Moldavian Territorial Group, National Commision of the USSR on Automatic Control [in Russian], Nos. 23?24 (1970), pp. 59?64.
[308] A. K. Romanov and B. P. Zelentsov, ?Application of the theory of Markov chains to the analysis of system reliability,? Discrete Analysis [in Russian], No. 7, Novosibirsk (1966), pp. 29?43.
[309] I. P. Romashkin, ?A single-channel system with failures,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 2, 68?72 (1969).
[310] S. Yu. Ruderman, ?Calculation of system reliability with allowance for the probable mode of element operation,? Izv. Akad. Nauk SSSR, Tekh. Kibernatika, No. 4, 40?41 (1964).
[311] S. Yu. Ruderman, ?Reliability of an element operating in short intervals within a system at random times,? Uch. Zap. Bashkirsk. Univ., No. 20, 114?118 (1965).
[312] S. Yu. Ruderman, ?Reliability and statistical self-control of complex systems with allowance for the probable mode of element operation,? Theory of Finite and Probabilistic Automata [in Russian], Nauka, Moscow (1965), pp. 324?328.
[313] S. Yu. Ruderman, ?Reliability of a system in a random mode of operation,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6, 38?40 (1965).
[314] V. Rudlovchak, ?The Palm problem for a system with finite queue size,? Computational Methods and Programming [in Russian], No. 9, Moskov. Univ., Moscow (1967), pp. 131?142.
[315] V. Rudlovchak, ?Optimal control of storage centers with random delivery delays,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3, 20?31 (1966).
[316] I. A. Ryabinin and V. D. Rubinovich, ?Influence of the type of distribution laws for the failure-free operation and repair times on the reliability characteristics of a standby system,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 46?53.
[317] A. T. Ryabtsev, G. P. Spekhova, and Yu. V. Chuev, ?Random search in probability space for the solution of the problem of the optimal equipment replacement periods,? Avtomat. i Vychisl. Tekh., No. 5, 25?29 (1969).
[318] É. G. Samandarov, ?Queueing in the case of a nonorderly input process,? Limit Theorems for Probabilities [in Russian], Akad. Nauk UzSSSR, Tashkent (1963), pp. 108?117.
[319] É. G. Samandarov, ?Queueing systems under heavy traffic conditions,? Teor. Veroyat. i Prim.,8, No. 3, 327?330 (1963).
[320] É. G. Samandarov, ?Stationary distribution in certain queueing systems,? Dokl. Akad. Nauk TadzhSSR,6, No. 3, 7?10 (1963).
[321] É. G. Samandarov, ?On the busy period of a queueing system with batched input,? Dokl. Akad. Nauk TadzhSSR,6, No. 4, 3?7 (1963).
[322] É. G. Samandarov, ?On the limiting behavior of the waiting-time distribution,? Dokl. Akad. Nauk TadzhSSR,9, No. 1, 3?7 (1966).
[323] I. Sapagovas, ?Convergence of superpositions of Markovian renewal processes to a Poisson process,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),6, No. 2, 271?277 (1966).
[324] I. Sapagovas, ?Reliability of a repairable system with dependent elements,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),9, No. 3, 589?604 (1969).
[325] I. Sapagovas, ?Convergence of superpositions of Markovian renewal processes to a multivariate Poisson process,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.,),9, No. 4, 817?826 (1969).
[326] L. Saulis, ?Asymptotic expansion for the probabilities of large excursions,? Liet. Matem. Rinkinys. (Lit. Matem. Sborn.),9, No. 3, 605?625 (1969).
[327] Ya. Ya. Sedol, ?Algebraic methods for the analysis of incompletely accessible networks,? Latvian Mathematical Yearbook [in Russian], Vol. 2, Riga (1966), pp. 299?319.
[328] Ya. Ya. Sedol, ?Investigation of incompletely accessible networks under heavy traffic,? Latvian Mathematical Yearbook [in Russian], Vol. 6 (1969), pp. 165?186.
[329] Ya. Ya. Sedol and M. A. Shneps, ?Qualitative investigations of incompletely accessible networks,? Probl. Peredachi Inform.,1, No. 2, 87?94 (1965).
[330] N. M. Sedyakin, ?Application of the coincidence method to the reliability analysis of engineering systems operating in a stationary state,? Izv. Akad. Nauk SSSR, Tekh. Kibernet., No. 2, 9?19 (1965).
[331] V. S. Sil’vestrov, ?Asymptotic behavior of the arrival time for sums of stochastic variables controlled by a regular semi-Markov process,? Dokl. Akad. Nauk SSSR,189, No. 5, 949?951 (1969).
[332] S. N. Simonova (S. M. Simonova), ?Multichannel system with losses and a semi-Markov input,? Kibernetika, No. 6, 48?53 (1967).
[333] S. N. Simonova (S. M. Simonova), ?Single-channel system with losses and a semi-Markov input,? Dopovidi Akad. Nauk UkrRSR,A, No. 12, 1089?1093 (1968).
[334] S. N. Simonova (S. M. Simonova), ?On the input process of single-server queueing systems,? Ukrainsk. Matem. Zh.,21, No. 4, 501?510 (1969).
[335] S. Kh. Sirazhdinov, T. A. Azlarov, and D. Kh. Sultanova, ?Asymptotic analysis of certain queueing systems,? Large Systems, Queueing, and Reliability [in Russian], Nauka, Moscow (1970), pp. 351?358.
[336] I. M. Slivnyak, ?Stationary streams of homogeneous random events,? Vest. Khar’kov. Univ., Ser. Mekhan.-Matem., No. 4, 73?116 (1966).
[337] A. D. Solov’ev, ?Reliability of systems with repair,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 189?193.
[338] A. D. Solov’ev, ?Asymptotic distribution of the lifetime of a standby element,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 119?121 (1964).
[339] A. D. Solov’ev, ?On standby redundancy without repair,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 83?121.
[340] A. D. Solov’ev, ?Determination of optimal preventive-maintenance policies for standby redundant systems,? Applied Problems of Engineering Cybernetics [in Russian], Sov. Radio, Moscow (1966), pp. 182?190.
[341] A. D. Solov’ev, ?The cyclic service problem,? Applied Problems of Engineering Cybernetics [in Russian], Sov. Radio, Moscow (1966), pp. 230?234.
[342] A. D. Solov’ev, ?On rapid-repair standby redundancy,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 6, (1970).
[343] K. B. Starobin, ?A queueing system with ?exponentially impatient? customers,? Trudy Leningrad, Inzh.-Ékon. Inst., No. 63, 51?54 (1966).
[344] S. M. Stoyanovich, ?A queueing system under heavy traffic conditions,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 225?230.
[345] S. M. Stoyanovich, ?Optimal control of several queues with finite input sources,? Matem. Vesn.,6, No. 4, 413?416 (1969).
[346] F. Sultanov, ?Determination of the optimal network for the allocation of urban commuter transportation with the application of mathematical methods,? Proc. Seminar: Application of Mathematical Methods in Economics Research and Planning [in Russian], No. 2, Kiev (1968), pp. 89?104.
[347] D. Kh. Sultanova, ?Some asymptotic problems for a queueing system with preventive maintenance and repair,? Izv. Akad. Nauk UzSSR, Ser. Fiz.-Matem. Nauk, No. 1, 20?25 (1968).
[348] D. Kh. Sultanova, ?A queueing system with preventive maintenance and repair,? Nauch. Trudy Tashkent. Univ., No. 349, 52?60 (1969).
[349] D. Kh. Sultanova, ?Some asymptotic expressions for a queueing system with preventive maintenance and repair,? Mathematical Methods in Quality Control and Reliability [in Russian], Fan, Tashkent (1969), pp. 79?84.
[350] L. N. Suchkov, ?Optimization of the reliability characteristics of complex systems in terms of controllable semi-Markov processes,? Fourth All-Republic Sci. Conf. Junior Systems Engineering Researchers [in Russian], Vol. 2, Kiev (1969), pp. 89?92.
[351] Kuang-huai Hsü, ?On the transient behavior of the queueing process GI|M|n,? Acta Math. Sinica,15, No. 1, 91?120 (1965).
[352] Kuang-huai Hsü, ?Waiting-time distributions for the queueing system GI|M|n with batched service,? Acta Math. Sinica,14, No. 6, 796?808 (1964).
[353] A. Ch. Tagyev, ?Analytic method for determining the optimal number of units,? Za Tekh. Progress, No. 6, 9?11 (1966).
[354] V. F. Taraskin, ?Application of queueing theory to the optimization of a first-aid substation,? Conf. Application of Computers and Mathematical Methods in Health-Care Administration, 1969 [in Russian], Moscow (1969), pp. 58?61.
[355] M. G. Teplitskii, ?A queueing system with controllable server operation,? Avtomat. i Vychisl. Tekh., No. 2, 36?42 (1968).
[356] M. G. Teplitskii, ?Determination of the optimal service discipline for a queueing system with controllable server operation,? Avtomat. i Vychisl. Tekh., No. 6, 61?65 (1968).
[357] A. A. Tomusyak, ?Calculation of the ergodic distribution of Markov and semi-Markov processes,? Kibernetika, No. 1, 68?71 (1969).
[358] A. F. Torondzhadze, ?A generalization of the continuous-time problem in storage theory,? Trudy Inst. Prikl. Matem. Tbilissk. Univ.,1, 149?152 (1969).
[359] A. F. Torondzhadse, ?A continuous-time problem in storage theory,? Trudy Inst. Prikl. Matem. Tbilissk. Univ.,1, 137?147 (1969).
[360] T. G. Trushko and É. S. Shtatland, ?Limiting behavior of a queueing system and the control problem for that system in the stationary state,? Proc. Seminar: Optimal Decision Theory [in Russian], No. 2, Kiev (1968), pp. 84?90. · Zbl 0402.60092
[361] Fang Wu, ?The GI|M|n queueing process,? Acta Math. Sinica,11, No. 4, 295?305 (1961). · Zbl 0147.16901
[362] I. A. Ushakov, ?On the optimal standby redundancy problem for a nonmultiplicative objective function,? Avtomat. i Vychisl. Tekh., No. 3, 53?56 (1967).
[363] I. A. Ushakov, ?A generalization of moving redundancy,? Tekh. Kibernetika, No. 6, 66?69 (1967).
[364] M. A. Fedotkin, ?Investigation of the statistical stability of transportation flows at an intersection controlled by an automatic system with feedback,? Teor. Veroyat. i Prim.,14, No. 3, 488?498 (1969).
[365] V. G. Filippovskii, ?An alternative approach to the determination of loss probability in a linear discrete system with constant service time,? Proc. Seminar: Complex Systems and Modeling [in Russian], No. 1, Kiev (1968), pp. 62?66.
[366] P. Franken, ?Refinement of a limit theorem for a superposition of independent renewal processes,? Teor. Veroyat. i Prim.,8, No. 3, 341?349 (1963). · Zbl 0124.33602
[367] A. L. Fuksman, E. D. Kharlamova, and N. V. Shmailo, ?Acceleration of the failure simulation process for large systems,? Avtomat. i Vychisl. Tekh., No. 1, 62?64 (1969).
[368] Jiro Fukuta, ?A queueing system with a complex service mode,? Kéiéi Kagaku,11, No. 1, 10?28 (1967).
[369] Z. S. Khalil’, ?A standby redundancy problem with repair,? Electron. Informationsverarb. und Kibernetik.,4, No. 5, 327?340 (1968).
[370] Atsusi Hasida and Yosisaku Nakamura, ?Analysis of multiserver queueing systems,? Kéiéi Kagaku,13, No. 1, 30?47 (1969).
[371] A. Ya. Khinchin, Works on Mathematical Queueing Theory [in Russian], Fizmatgiz, Moscow (1963), 135 pages.
[372] M. L. Tsetlin, A. V. Butrimenko, and S. L. Ginzburg, ?An algorithm for the control of a communication network,? Problems in Cybernetics [in Russian], No. 20, Nauka, Moscow (1968), pp. 27?38.
[373] I. N. Tsukanov, ?Stationary distribution of states of a multiserver queueing system in the case of a simply connected input process,? Proc. Seminar: Complex Systems and Modeling [in Russian], No. 1, Kiev (1969), pp. 42?55.
[374] A. M. Chavkin, ?Aspects of the servicing of inputs in a multiphase system with unreliable servers,? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 231?240.
[375] A. P. Cherenkov, ?Some limiting relations for estimates of the reliability of a multidimensional dynamic system? Reliability and Queueing Theory [in Russian], Nauka, Moscow (1969), pp. 172?177.
[376] R. Ya. Chitashvili, ?Determination of the optimal stationary mode in optimally planned storage systems; Markovian models,? Trudy Inst. Prikl. Matem. Tbilissk. Univ.,1, 193?212 (1969).
[377] A. A. Shakhbazov and É. G. Samandarov, ?Servicing a nonorderly input process,? Cybernetics in the Service of Communism [in Russian], Vol. 2, Énergiya, Moscow-Leningrad (1964), pp. 338?353.
[378] M. A. Shneps, ?Application of the method of imbedded Markov chains to the simulation of queueing systems with losses,? Zinatn. Raksti. Latv. Univ. (Uch. Zap. Latv. Univ.),47, 261?266 (1963).
[379] M. A. Shneps, ?Investigation of single-stage incompletely accessible telephone systems on an electronic computer,? Problems in Information Transmission [in Russian], No. 12, Akad. Nauk SSSR, Moscow (1963), pp. 109?123.
[380] M. A. Shneps, ?The use of Markov chains for the analysis of telephone systems with losses,? Problems in Information Transmission [in Russian], No. 12, Akad. Nauk SSSR, Moscow (1963), pp. 124?134.
[381] M. A. Shneps, ?A generalization of the Erlang equation to nonorderly input processes,? Problems in Information Transmission [in Russian], No. 17, Nauka, Moscow (1964), pp. 103?105.
[382] M. A. Shneps-Shneppe and É. A. Ikaunieks, ?Error analysis of loss-probability estimates for a one-channel system,? Latvian Mathematical Yearbook [in Russian], Vol. 6 (1969), pp. 187?206.
[383] V. F. Shukailo, ?Some generalizations of renewal theory for special engineering problems,? Sixth Sci.-Tech. Conf. Ukraine Correspondence Polytechnic Institute [in Russian], Khar’kov. Univ., Kharkov (1966), pp. 99?116.
[384] Yu. N. Shul’ga, ?On the optimization of service in systems with waiting,? Ékonom. i Matem. Metody,6, No. 1, 136?139 (1970).
[385] O. V. Shcherbakov, ?Estimation of the number of lost inputs due to server unreliability,? Avtomat. i Telemekhan.,26, No. 10, 1813?1817 (1965).
[386] M. I. Yadrenko, ?Periodic incomplete monitoring of a single server,? Avtomat. i Vychisl. Tekh., No. 3, 57?61 (1967).
[387] Yu. F. Yakushev, ?A queueing problem for the servicing of an input process by unreliable servers,? Prob. Peredachi Inform.,5, No. 4, 84?88 (1969).
[388] N. V. Yarovitskii, ?On the problem of multiphase service with losses,? Ukrainsk. Matem. Zh.,16, No. 3, 421?427 (1964). · Zbl 0202.47902 · doi:10.1007/BF02538025
[389] N. V. Yarovitskii, ?Probabilistic-automaton simulation of discrete systems,? Kibernetika, No. 5, 35?43 (1966).
[390] N. V. Yarovitskii, ?Probabilistic balance of states of series-connected elements,? Applied Problems of Engineering Cybernetics [in Russian], Sov. Radio, Moscow (1966), pp. 103?114.
[391] N. V. Yarovitskii, ?Investigation of the stationary operation of a closed system acted upon by a periodic random input signal,? Kibernetika, No. 1, 47?51 (1966).
[392] N. V. Yarovitskii, ?Behavior of a system of automata acted upon by a nonstationary random signal,? Proc. Third All-Union Conf. Automatic Control (Engineering Cybernetics), 1965: Self-Adaptive Systems [in Russian], Nauka, Moscow (1967), pp. 427?430.
[393] N. V. Yarovitskii, ?Limiting behavior of a closed system of automata with random output,? Kibernetika, No. 1, 57?61 (1965).
[394] N. V. Yarovitskii, ?Resolving power of a probabilistic system that distorts a signal transmitted through it,? Seminar: Theory of Automata [in Russian], No. 2, Kiev (1967), pp. 45?53.
[395] N. V. Yarovitskii, ?Stationary distributions of the states of elements of a discrete system,? Seminar: Theory of Automata [in Russian], No. 1, Nauk. Dumka, Kiev (1966), pp. 34?44.
[396] N. V. Yarovitskii, ?An existence theorem for ergodic distributions for a particular frequency system of automata,? Seminar: Theory of Automata [in Russian], No. 1, Nauk. Dumka, Kiev (1966), pp. 22?33.
[397] M. Ya. Yastrebenetskii, ?Reliability of unrepairable objects subject to external effects,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 3, 50?60 (1970).
[398] M. Ya. Yastrebenetskii, ?Reliability of repairable objects subject to external effects,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 4, 43?53 (1970).
[399] M. A. Yastrebenetskii, ?On a class of regenerative stochastic processes,? Izv. Akad. Nauk SSSR, Tekh. Kibernetika, No. 5, 50?60 (1969).
[400] I. Adiri, ?A time-sharing queue with preemptive-resume priority discipline,? Israel J. Technol.,6, No. 5, 277?282 (1968). · Zbl 0238.60081
[401] I. Adiri, ?Computer time-sharing queues with priorities,? J. Assoc. Comput. Mach.,16, No. 4, 631?645 (1969). · Zbl 0187.14803 · doi:10.1145/321541.321552
[402] I. Adiri and B. Avi-Itzhak, ?A time-sharing queue with a finite number of customers,? J. Assoc. Comput. Mach.,16, No. 2, 315?323 (1969). · Zbl 0181.23004 · doi:10.1145/321510.321523
[403] I. Adiri and B. Avi-Itzhak, ?A time-sharing queue,? Management Sci.,15, No. 11, 639?657 (1969). · Zbl 0179.23701 · doi:10.1287/mnsc.15.11.639
[404] I. Adiri and B. Avi-Itzhak, ?A time-sharing model with many queues,? Operat. Res.,17, No. 6, 1077?1089 (1969). · Zbl 0183.49301 · doi:10.1287/opre.17.6.1077
[405] R. A. Agnew, Transformations of Uniform and Stationary Point Processes (Doctoral Dissertation), Northwestern Univ. (1968), 60 pages; Dissert. Abstr.,B29, No. 7, 2517 (1969).
[406] Akimaru Haruo and Nishimura Tsunako, ?The derivatives of Erlang’s B formula,? Rev. Electr. Commun. Lab.,11, Nos. 9?10, 428?445 (1963).
[407] M. S. Ali Khan and J. Gani, ?Infinite dams with inputs forming a Markov chain,? J. Appl. Probab.,5, No. 1, 72?83 (1968). · Zbl 0182.53301 · doi:10.1017/S0021900200032307
[408] R. R. Allan, ?A model for correlated traffic,? Transport. Res.,2, No. 3, 235?248 (1968). · doi:10.1016/0041-1647(68)90017-8
[409] W. R. Allen, ?Simple inventory models with bunched inputs,? Nav. Res. Log. Quart.,9, Nos. 3?4, 265?273 (1962). · Zbl 0114.11702 · doi:10.1002/nav.3800090309
[410] R. V. Ambartsumyan [Ambartzumian], ?Two inverse problems concerning the superposition of recurrent point processes,? J. Appl. Probab.,2, No. 2, 449?454 (1965). · doi:10.1017/S0021900200108769
[411] R. V. Ambartsumyan [Ambartzumian], ?Correlation properties of the intervals in the superpositions of independent stationary recurrent point processes,? Studia Sci. Math. Hung.,4, Nos. 1?4, 161?170 (1969).
[412] C. J. Ancker, Jr., and A. V. Gafarian, ?Some queueing problems with balking and reneging (I),? Operat. Res.,11, No. 1, 88?100 (1963). · Zbl 0109.36604 · doi:10.1287/opre.11.1.88
[413] C. J. Ancker, Jr., and A. V. Gafarian, ?Some queueing problems with balking and reneging (II),? Operat. Res.,11, No. 6, 928?937 (1963). · Zbl 0123.35805 · doi:10.1287/opre.11.6.928
[414] C. J. Ancker, Jr., and A. V. Gafarian, ?Queueing with reneging and multiple heterogeneous servers,? Nav. Res. Log. Quart.,10, No. 2, 125?149 (1963). · Zbl 0117.36001 · doi:10.1002/nav.3800100112
[415] D. E. Anderson, ?Reliability of a class of redundant systems,? IEEE Trans. Reliability,R-18, No. 1, 21?28 (1969). · doi:10.1109/TR.1969.5216964
[416] K. L. Arora, ?Two-server bulkservice queueing process,? Operat. Res.,12, No. 2, 286?294 (1964). · Zbl 0123.35802 · doi:10.1287/opre.12.2.286
[417] B. Avi-Itzhak, ?Preemptive repeat priority queues as a special case of the multipurpose server problem (I),? Operat. Res.,11, No. 4, 597?609 (1963). · Zbl 0114.09204 · doi:10.1287/opre.11.4.597
[418] B. Avi-Itzhak, ?Preemptive repeat priority queous as a special case of the multipurpose server problem (II),? Operat. Res.,11, No. 4, 610?619 (1963). · Zbl 0114.09204 · doi:10.1287/opre.11.4.610
[419] B. Avi-Itzhak, ?A sequence of service stations with arbitrary input and regular service times,? Management Sci.,11, No. 5, 565?571 (1965). · Zbl 0156.18602 · doi:10.1287/mnsc.11.5.565
[420] B. Avi-Itzhak, I. Brosh, and P. Naor, ?On discretionary priority queueing,? Z. Angew. Math. Mech.,44, No. 6, 235?242 (1964). · Zbl 0129.30903 · doi:10.1002/zamm.19640440603
[421] B. Avi-Itzhak, and P. Naor, ?Multi-purpose service stations in queueing problems,? Proc. Third Internat. Conf. Operations Research, Oslo, 1963, Paris-London (1964), pp. 423?438. · Zbl 0178.53603
[422] B. Avi-Itzhak and M. Yadin, ?A sequence of two servers with no intermediate queue,? Management Sci.,11, No. 5, 553?564 (1965). · Zbl 0178.53503 · doi:10.1287/mnsc.11.5.553
[423] C. R. Baldini, ?A study of the cyclic use of the same central unit by many customers,? ICC Bull.,6, No. 1, 27?38 (1967).
[424] R. E. Barlow, ?Applications of semi-Markov processes to counter problems,? Studies in Applied Probability and Management Science, Stanford Univ. Press, Palo Alto, Calif. (1962), pp. 34?62.
[425] R. E. Barlow, ?Reliability theory,? Mathematical Decision Science, Part 2, Providence, R. I. (1968), pp. 255?266.
[426] R. E. Barlow and A. W. Marshall, ?Bounds for distributions with monotone hazard rate (I),? Ann. Math. Statist.,35, No. 3, 1234?1257 (1964). · Zbl 0245.60012 · doi:10.1214/aoms/1177703281
[427] R. E. Barlow and A. W. Marshall, ?Bounds for distributions with monotone hazard rate (II),? Ann. Math. Statist.,35, No. 3, 1258?1274 (1964). · doi:10.1214/aoms/1177703282
[428] R. E. Barlow, A. W. Marshall, and F. Proschan, ?Properties of probability distributions with monotone hazard rate,? Ann. Math. Statist.,34, No. 2, 375?389 (1963). · Zbl 0249.60006 · doi:10.1214/aoms/1177704147
[429] R. E. Barlow and F. Proschan, ?Comparison of replacement policies, and renewal theory implications,? Ann. Math. Statist.,35, No. 2, 577?689 (1964). · Zbl 0135.18904 · doi:10.1214/aoms/1177703557
[430] D. J. Bartholomew, ?A multi-stage renewal process,? J. Roy. Statist. Soc.,B25, No. 1, 150?168 (1963). · Zbl 0123.35303
[431] J. A. Bather, ?The optimal regulation of dams in continuous time,? J. Soc. Industr. Appl. Math.,11, No. 1, 33?63 (1963). · Zbl 0129.34502 · doi:10.1137/0111003
[432] A. Beja, ?Probability bounds in replacement policies for Markov systems,? Management Sci.,16, No. 3, 253?264 (1969). · Zbl 0186.25102 · doi:10.1287/mnsc.16.3.253
[433] Y. K. Belyaev, B. V. Gnedenko, and A. D. Solov’ev [Soloviev], ?On some stochastic problems of reliability theory,? Proc. Fifth Berkeley Sympos. Mathematical Statistics and Probability, 1965?1966, Vol. 3, Berkeley-Los Angeles (1967), pp. 259?270.
[434] V. E. Benes, ?Markov processes representing traffic in connecting networks,? Bell System Tech. J.,42, No. 6, 2795?2837 (1963). · Zbl 0125.09802 · doi:10.1002/j.1538-7305.1963.tb00987.x
[435] V. E. Benes, ?Some inequalities in the theory of telephone traffic,? Bell System Tech. J.,44, No. 9, 1941?1975 (1965). · Zbl 0139.34907 · doi:10.1002/j.1538-7305.1965.tb03154.x
[436] D. L. Bentley, ?A contribution to counter theory,? J. Roy. Statist. Soc.,B25, No. 1, 169?178 (1963). · Zbl 0249.60052
[437] G. Bergmann, ?Seltene Ereignisse und Poisson-Verteilung,? Metrika,14, No. 1, 1?20 (1968). · Zbl 0169.21102 · doi:10.1007/BF02613638
[438] F. J. Beutler and O. A. Z. Leneman, ?The theory of stationary point processes,? Acta Math.,116, Nos. 3?4, 159?197 (1966). · Zbl 0147.16003 · doi:10.1007/BF02392816
[439] O. Beyer, ?Über die Zuverlässigkeitstheorie,? Wissenschaft. Z. Tech. Hochschule Otto von Geuricke (Magdeburg),13, Nos. 3?4, 185?188 (1969). · Zbl 0175.17302
[440] U. Narayan Bhat, ?Imbedded Markov chain analysis of single-server bulk queues,? J. Austral. Math. Soc.,4, No. 2, 244?263 (1964). · Zbl 0124.34203 · doi:10.1017/S1446788700023454
[441] U. Narayan Bhat, ?On the busy period of a single-server bulk queue with a modified service mechanism,? Calcutta Statist. Assoc. Bull.,13, Nos. 51?52, 163?171 (1964). · Zbl 0134.14404 · doi:10.1177/0008068319640304
[442] U. Narayan Bhat, ?On single-server bulk-queueing processes with binomial input,? Operat. Res.,12, No. 4, 527?533 (1964). · Zbl 0125.08502 · doi:10.1287/opre.12.4.527
[443] U. Narayan Bhat, ?Customer overflow in queues with finite waiting space,? Austral. J. Statist.,7, No. 1, 15?19 (1965). · Zbl 0161.37405 · doi:10.1111/j.1467-842X.1965.tb00257.x
[444] U. Narayan Bhat, ?On a stochastic process occurring in queueing systems,? J. Appl. Probab.,2, No. 2, 467?469 (1965). · Zbl 0141.15904 · doi:10.1017/S0021900200108794
[445] U. Narayan Bhat, ?The queue GI|M|2 with service rate depending on the number of busy servers,? Ann, Inst. Statist. Math.,18, No. 2, 211?221 (1966). · Zbl 0143.40604 · doi:10.1007/BF02869531
[446] U. Narayan Bhat, ?Some explicit results for the queue GI|M|1 with group service,? Sankhya, Indian J. Statist.,A29, No. 2, 199?206 (1967).
[447] U. Narayan Bhat, ?Transient behavior of multi-server queues with recurrent input and exponential service times,? J. Appl. Probab.,5, No. 1, 158?168 (1968). · Zbl 0162.49301 · doi:10.1017/S0021900200032356
[448] U. Narayan Bhat, A study of the queueing systems M|G|1 and GI|M|1, Lecture Notes on Operations Research and Mathematical Economics, No. 2 (1968), 78 pages. · Zbl 0167.17102
[449] U. Narayan Bhat, ?Some queueing systems with mixed disciplines,? SIAM J. Appl. Math.,18, No. 2, 415?432 (1970). · Zbl 0193.46202 · doi:10.1137/0118036
[450] S. K. Bhattacharya, ?A modified Bessel function model in life testing,? Metrika,11, No. 2, 133?144 (1966). · Zbl 0156.40102 · doi:10.1007/BF02613584
[451] W. Bisi, ?Le file d’attesa in fase pre-stazionaria,? Statistica,23, No. 3, 363?377 (1963).
[452] A. Blanc-Lapierre and R. Sultan, ?Sur duex modèles de fonctions alèatoires dérivés d’un processus de Poisson,? Compt. Rend.,269, No. 8, A326-A328 (1969). · Zbl 0183.46501
[453] G. Blom, ?Some contributions to the theory of machine interference,? Biometrika,50, Nos. 1?2, 135?143 (1963). · Zbl 0117.13403 · doi:10.1093/biomet/50.1-2.135
[454] N. Blomqvist, ?The covariance function of the M|G|1 queueing system,? Skand. Aktuarietidskr., Nos. 3?4, 157?182 (1967).
[455] N. Blomqvist, ?Estimation of waiting-time parameters in the GI|G|1 queueing system, Part 1: General results,? Skand. Aktuarietidskr., Nos. 3?4, 178?197 (1968).
[456] N. Blomqvist, ?Estimation of waiting-time parameters in the GI|G|1 queueing system, Part II: Heavy traffic approximations,? Skand. Aktuarietidskr., Nos. 3?4, 125?136 (1969).
[457] D. C. Boes, ?Note on the output of a queueing system,? J. Appl. Probab.,6, No. 2, 459?461 (1969). · doi:10.1017/S0021900200032976
[458] G. Bonnet, ?Influence de certains types d’effacement sur le spectre des fonctions associées à des processus de renouvellement,? Compt. Rend.,AB262, No. 1, A48-A51 (1966). · Zbl 0143.40401
[459] K. Bose, ?A solution for an infinite dam with time-homogeneous Markovian inputs,? Calcutta Statist. Assoc., Bull.,18, No. 70, 73?83 (1969). · Zbl 0184.23301 · doi:10.1177/0008068319690203
[460] J. G. van Bosse, ?Delay distributions in communications systems with partly ordered queues,? IEEE Trans. Communications Systems,CS-11, No. 3, 329?335 (1963).
[461] L. Breiman, ?The Poisson tendency in traffic distribution,? Ann. Math. Statist.,34, No. 1, 308?311 (1963). · Zbl 0117.13701 · doi:10.1214/aoms/1177704267
[462] H. Breny, ?Sur un point de la théorie des files d’attente,? Ann. Soc. Sci. Bruxelles, Ser. 1,76, No. 2, 5?12 (1962). · Zbl 0113.33903
[463] P. J. Brockwell, ?The transient behavior of a single-server queue with batch arrivals,? J. Austral. Math. Soc.,3, No. 2, 241?248 (1963). · Zbl 0211.48804 · doi:10.1017/S1446788700027981
[464] P. J. Brockwell, ?The transient behaviour of the queueing system GI|M|1,? J. Austral. Math. Soc.,3, No. 2, 249?256 (1963). · Zbl 0211.48704 · doi:10.1017/S1446788700027993
[465] I. Brosh, ?Preemptive priority assignment in multichannel systems,? Operat. Res.,17, No. 3, 526?535 (1969). · Zbl 0172.21804 · doi:10.1287/opre.17.3.526
[466] M. Brown, ?Some results on a traffic model of Rényl,? J. Appl. Probab.,6, No. 2, 293?300 (1969). · doi:10.1017/S0021900200032964
[467] M. Brown, ?An invariance property of Poisson processes,? J. Appl. Probab.,6, No. 2, 453?458 (1969). · Zbl 0211.48101 · doi:10.1017/S0021900200032964
[468] M. Brown and S. M. Ross, ?Some results for infinite-server Poisson queues,? J. Appl. Probab.,6, No. 3, 604?611 (1969). · Zbl 0208.46703 · doi:10.1017/S0021900200026656
[469] J. C. L. Buckland, ?A nomogram for stock control,? Operat. Res. Quart.,20, No. 4, 445?450 (1969). · doi:10.1057/jors.1969.102
[470] D. J. Buckely, ?A semi-Poisson model of traffic flow,? Transport. Sci.,2, No. 2, 107?133 (1968). · doi:10.1287/trsc.2.2.107
[471] D. J. Buckley and R. C. Wheeler, ?Some results for fixed-time traffic signals,? J. Roy. Statist. Soc.,B26, No. 1, 133?140 (1964). · Zbl 0123.35704
[472] P. J. Burke, ?Equilibrium delay distribution for one channel with constant holding time, Poisson input, and random service,? Bell System Tech. J.,38, 1021?1031 (1959). · doi:10.1002/j.1538-7305.1959.tb01587.x
[473] P. J. Burke, ?Priority traffic with at most one queueing class,? Operat. Res.,10, No. 4, 567?569 (1962). · Zbl 0212.24404 · doi:10.1287/opre.10.4.567
[474] P. J. Burke, ?The dependence of delays in a tandem queues,? Ann. Math. Statist.,35, No. 2, 874?875 (1964). · Zbl 0131.16901 · doi:10.1214/aoms/1177703590
[475] P. J. Burke, The Output Process of a Queueing System (Doctoral Dissertation), Columbia Univ. (1966), 45 pages; Dissert. Abstr.B27, No. 6, 2015 (1966).
[476] P. J. Burke, ?The dependence of sojourn times in tandem M|M|s queues,? Operat. Res.,17, No. 4, 754?755 (1969). · Zbl 0176.48001 · doi:10.1287/opre.17.4.754
[477] L. Castoldi, ?Poisson processes with events in clusters,? Rend. Semin. Fac. Sci. Univ. Cagliari,33, Nos. 3?4, 433?437 (1963?1964). · Zbl 0247.60014
[478] Wei Chang, ?Output distribution of a singel-channel queue,? Operat. Res.,11, No. 4, 620?623 (1963). · doi:10.1287/opre.11.4.620
[479] Wei Chang, ?Preemptive priority queues,? Operat. Res.,13, No. 5, 820?827 (1965). · Zbl 0212.24402 · doi:10.1287/opre.13.5.820
[480] Wei Chang, ?Priority queues with recurrent input,? Fifth Internat. Teletraffic Congr., Preprints of Technical Papers, S. 1, s. a., New York (1967), pp. 85?88.
[481] Wei Chang, ?Queueing analysis of real-time computer processing,? Management Sci.,15, No. 11, 638?671 (1969). · Zbl 0179.23001 · doi:10.1287/mnsc.15.11.658
[482] M. L. Chaudhry, ?Correlated queueing,? CORS Journal,3, No. 3, 142?151 (1965). · Zbl 0134.35104
[483] M. L. Chaudhry, ?Queueing problems with correlated arrivals and service through parallel channels,? CORS Journal,5, No. 1, 35?46 (1967). · Zbl 0154.19101
[484] C. K. Cheong, ?Ergodic and ratio limit theorems for ?-recurrent semi-Markov processes,? Z. Wahrscheinlichkeitstheor. und Verw. Geb.,9, No. 4, 270?286 (1968). · Zbl 0162.49001 · doi:10.1007/BF00531751
[485] C. K. Cheong and C. R. Heathcote, ?On the rate of convergence of waiting times,? J. Austral. Math. Soc.,5, No. 3, 365?373 (1965). · Zbl 0143.20403 · doi:10.1017/S1446788700027786
[486] S. S. Chitgopekar, ?Continuous-time Markovian sequential control processes,? SIAM J. Control,7, No. 3, 367?389 (1969). · Zbl 0184.19304 · doi:10.1137/0307027
[487] D. M. Cifarelli, ?Alcune considerazioni intorno al metodo dei punti di rigenerazione per ottenere l’equazione di Lindley e sua risoluzione approssimata,? Rend. Inst. Statist., No. 5, 25?38 (1965).
[488] E. Cinlar, ?Queues with semi-Markovian arrivals,? J. Appl. Probab.,4, No. 2, 365?379 (1967). · Zbl 0153.20001 · doi:10.1017/S0021900200032113
[489] E. Cinlar, ?On the superposition of m-dimensional point processes,? J. Appl. Probab.,5, No. 1, 169?176 (1968). · Zbl 0284.60048 · doi:10.1017/S0021900200032368
[490] E. Cinlar, ?Time dependence of queues with semi-Markovian services,? J. Appl. Probab.,4, No. 2, 356?364 (1967). · Zbl 0153.19904 · doi:10.1017/S0021900200032101
[491] E. Cinlar, ?On semi-Markov processes on arbitrary spaces,? Proc. Cambridge Phil. Soc.,66, No. 2, 381?392 (1969). · Zbl 0211.48404 · doi:10.1017/S0305004100045096
[492] E. Cinlar, ?Markov renewal theory,? Adv. Appl. Probab.,1, No. 2, 123?187 (1969). · Zbl 0212.49601 · doi:10.1017/S0001867800037046
[493] E. Cinlar and R. A. Agnew, ?On the superposition of point processes,? J. Roy. Statist. Soc.,B30, No. 3, 576?581 (1968). · Zbl 0185.45206
[494] G. Ciucu, ?Asupra unui model cu veniri in grup,? An., Univ. Bucuresti, Ser. Stint. Natur. Mat.-Mecan.,14, No. 1, 101?103 (1965).
[495] G. Ciucu, ?Asupra unui model de asteptare cu intr?ri dependente,? Studii Statist. Lucr?rile Celei 3 Consfat. Stint. Statist., 1963, Bucharest (1964), pp. 41?43; 945; 1009, 1077.
[496] G. Ciucu, ?Un model cu veniri in grup,? An. Univ. Bucuresti, Ser. Stint. Natur.,13, No. 2, 21?23 (1964).
[497] D. E. Cleveland and D. G. Capelle, ?Queueing theory approaches,? Highway Res. Board Spec. Rep., No. 79, 49?96 (1964).
[498] D. J. Clough and S. Kotz, ?Extreme-value distributions with a special queueing model application,? CORS Journal,3, No. 2, 96?109 (1965). · Zbl 0203.18602
[499] E. G. Coffman and A. C. McKellar, On the Motion of an Unbounded Markov Queue in Random-Acess Storage, Tech. Rep. Princeton Univ., No. 55 (1967), 15 pages.
[500] E. G. Coffman, Jr., R. R. Muntz, and H. Trotter, ?Waiting-time distributions for processor-sharing systems,? J. Assoc. Comput. Mach.,17, No. 1, 123?130 (1970). · Zbl 0197.15304 · doi:10.1145/321556.321568
[501] E. G. Coffman, Jr., and M. S. Schmookler, ?A random-walk model of a queue storage problem,? IEEE Trans. Computers,C-17, No. 11, 1093?1095 (1968). · Zbl 0275.60115 · doi:10.1109/TC.1968.226865
[502] J. W. Cohen, ?On two integral equations of queueing theory,? J. Appl. Probab.,4, No. 2, 343?355 (1967). · Zbl 0153.20101 · doi:10.1017/S0021900200032095
[503] J. W. Cohen, ?Review of recently obtained results on queueing theory,? Fifth Internat. Teletraffic Congr., Preprints Tech. Papers, S. 1, New York (1967).
[504] J. W. Cohen, ?Single-server queue with uniformly bounded virtual waiting time,? J. Appl. Probab.,5, No. 1, 93?122 (1968). · Zbl 0164.48103 · doi:10.1017/S0021900200032320
[505] J. W. Cohen, ?Extreme-value distribution for the M|G|1 and G|M|1 queueing systems,? Ann. Inst. Henri Poincaré, Sec. B,4, No. 1, 83?98 (1968). · Zbl 0162.49302
[506] J. W. Cohen, ?Single-server queues with restricted accessibility,? J. Engng. Math.,3, No. 4, 265?284 (1969). · Zbl 0186.24503 · doi:10.1007/BF01535299
[507] J. W. Cohen and I. Greenberg, ?Distribution of crossings of level K in a busy cycle of the M|G|1 queue,? Ann. Inst. Henri Poincaré, Sec. B,4, No. 1, 75?81 (1968).
[508] B. W. Conolly, ?The waiting-time process for a certain correlated queue,? Operat. Res.,16, No. 5, 1006?1015 (1968). · Zbl 0196.20401 · doi:10.1287/opre.16.5.1006
[509] B. W. Conolly and N. Hadidi, ?A correlated queue,? J. Appl. Probab.,6, No. 1, 122?136 (1969). · Zbl 0181.46801 · doi:10.1017/S0021900200032575
[510] B. W. Conolly and N. Hadidi, ?A comparison of the operational features of conventional queues with a self-regulating system,? Appl. Statist.,18, No. 1, 41?53 (1969). · doi:10.2307/2346438
[511] R. B. Cooper, ?Queues served in cyclic order: waiting times,? Bell System. Tech. J.,49, No. 3, 399?413 (1970). · Zbl 0208.22502 · doi:10.1002/j.1538-7305.1970.tb01778.x
[512] R. B. Cooper and G. Murray, ?Queues served in cyclic order,? Bell System Tech. J.,48, No. 3, 675?689 (1969). · Zbl 0169.20804 · doi:10.1002/j.1538-7305.1969.tb01133.x
[513] B. D. Craven ?Some results for the bulk-service queue,? Austral. J. Statist.,5, No. 2, 49?56 (1963). · Zbl 0124.34303 · doi:10.1111/j.1467-842X.1963.tb00140.x
[514] B. D. Craven, ?Asymptotic transient behaviour of the bulk-service queue,? J. Austral. Math. Soc.,3, No. 4, 503?512 (1963). · Zbl 0211.48802 · doi:10.1017/S1446788700039136
[515] B. D. Craven, ?Asymptotic correlation in a queue,? J. Appl. Probab.,6, No. 3, 573?583 (1969). · Zbl 0191.50402 · doi:10.1017/S0021900200026620
[516] G. Cusimano, ?Problemi di interferenza delle macchine nella teoria statistica delle file d’attesa,? Statistica,19, No. 3, 361?414 (1959).
[517] D. J. Daley, ?General customer impatience in the queue GI|G|1,? J. Appl. Probab.,2, No. 1, 186?205 (1965). · Zbl 0134.14402 · doi:10.1017/S0021900200031685
[518] D. J. Daley, ?Single-server queueing systems with uniformly limited queueing time,? J. Austral. Math. Soc.,4, No. 4, 489?505 (1964). · Zbl 0131.16802 · doi:10.1017/S1446788700025325
[519] D. J. Daley, ?Monte Carlo estimation of the mean queue size in a stationary GI|M|1 queue,? Operat. Res.,16, No. 5, 1002?1005 (1968). · Zbl 0196.20402 · doi:10.1287/opre.16.5.1002
[520] D. J. Daley, ?The serial correlation coefficients of waiting times in a stationary single-server queue,? J. Austral. Math. Soc.,8, No. 4, 683?699 (1968). · Zbl 0164.47802 · doi:10.1017/S1446788700006509
[521] D. J. Daley, ?The total waiting time in a busy period of a stable single-server queue (I),? J. Appl. Probab.,6, No. 3, 550?564 (1969). · Zbl 0208.22602 · doi:10.1017/S0021900200026607
[522] D. J. Daley and D. R. Jacobs, Jr., ?The total waiting time in a busy period of a stable single-server queue (II),? J. Appl. Probab.,6, No. 3, 565?572 (1969). · Zbl 0208.22603 · doi:10.1017/S0021900200026619
[523] D. J. Daley and A. P. Moran, ?Two-sided inequalities for waiting-time and queue-size distributions in GI|G|1,? Teor. Veroyat. i Ee Prim.,13, No. 2, 356?359 (1968). · Zbl 0164.48002
[524] J. N. Darroch, ?On the traffic-light queue,? Ann. Math. Statist.,35, No. 1, 380?388 (1964). · Zbl 0127.35102 · doi:10.1214/aoms/1177703761
[525] E. Daru, ?Un probléme de file d’attente; cas de plusieurs machines à durées de fonctionnement exponentielles reparées dans un service à loi d’Erlang,? Rev. Franc. Rech. Opérat.,5, No. 21, 301?312 (1961).
[526] A. W. Davis, ?On the characteristic functional for a replacement model,? J. Austral. Math. Soc.,4, No. 2, 233?243 (1964). · Zbl 0122.13903 · doi:10.1017/S1446788700023442
[527] R. H. Davis, ?Waiting-time distribution of a multiserver priority queueing system,? Operat. Res.,14, No. 1, 133?136 (1966). · Zbl 0134.14301 · doi:10.1287/opre.14.1.133
[528] L. E. N. Delbrouck, ?A feedback queueing system with batch arrivals, bulk service, and queue-dependent service time,? J. Assoc. Comput. Mach.,17, No. 2, 314?323 (1970). · Zbl 0195.21401 · doi:10.1145/321574.321585
[529] A. Descloux, On the Covariance between the Number of Offered and the Number of Overflow Requests in Systems with Limited Capacity (Doctoral Dissertation), Univ. North Carolina (1961), 102 pages; Dissert. Abstr.,23, No. 2, 639?640 (1962).
[530] R. S. Dick, ?The reliability of repairable complex systems, Part B: The dissimilar machine case,? IEEE Trans. Reliability,R-12, No. 1, 1?8 (1963). · doi:10.1109/TR.1963.5218183
[531] R. S. Dick, On Single-Server Queues with Balking and Single or Batched Service (Doctoral Dissertation), Columbia Univ. (1968), 81 pages; Dissert. Abstr.,B29, No. 3, 1087 (1968).
[532] R. L. Disney, ?Some results of multichannel queueing problems with ordered entry ? an application to conveyor theory,? J. Indust. Engng.,14, No. 2, 105?108 (1963).
[533] F. Downton, ?An integral equation approach to equipment failure,? J. Roy. Statist. Soc.,B31, No. 2, 335?349 (1969).
[534] P. Dubois, ?Introduction à la théorie des phénomènes d’attente,? Mitt. Verein. Schweiz. Versicherungsmath.,67, No. 2, 159?171 (1967).
[535] M. C. Dunne, R. W. Rothery, and R. B. Potts, ?A discrete Markov model of vehicular traffic,? Transport. Sci.,2, No. 3, 233?251 (1968). · doi:10.1287/trsc.2.3.233
[536] M. R. Dyer and D. H. Young, ?A note on the reliability of a system with spares which operates at discrete times,? Technometrics,12, No. 3, 702?705 (1970). · Zbl 0205.22902 · doi:10.1080/00401706.1970.10488711
[537] Masao Ebe, ?On sets of motion of point processes,? J. Operat. Res. Soc. Japan,11, No. 3, 97?113 (1969). · Zbl 0191.47202
[538] M. M. Eisen, ?Effects of slowdowns and failure on stochastic service systems,? Technometrics,5, No. 3, 385?392 (1963). · Zbl 0112.10201 · doi:10.1080/00401706.1963.10490106
[539] M. M. Eisen and M. Leibowitz, ?Some remarks on server breakdown,? Operat. Res.,12, No. 1, 155?158 (1964). · Zbl 0123.35703 · doi:10.1287/opre.12.1.155
[540] M. M. Eisen and M. Tainiter, ?Stochastic variations in queueing processes,? Operat. Res.,11, No. 6, 922?927 (1963). · Zbl 0141.16204 · doi:10.1287/opre.11.6.922
[541] J. J. Eiss, ?The reliability of dependent parallel or standby N-unit redundancies,? Operat. Res.,16, No. 5, 1068?1083 (1968). · Zbl 0174.50601 · doi:10.1287/opre.16.5.1068
[542] G. Elfving, ?A persistency problem connected with a point process,? J. Appl. Probab.,4, No. 1, 77?89 (1967). · Zbl 0183.20705 · doi:10.1017/S0021900200025237
[543] E. G. Enns ?Demand interval reliability,? Ann. Tech. Conf., Trans. Amer. Soc. Quality Control, Chicago, Ill., 1967, Milwaukee, Wisc. (1967), pp. 483?493.
[544] E. G. Enns, ?The trivariate distribution of the maximum queue length, the number of customers served, and the duration of the busy period for the M|G|1 queueing system,? J. Appl. Probab.,6, No. 1, 154?161 (1969). · Zbl 0183.49402 · doi:10.1017/S0021900200032599
[545] E. G. Enns, ?Some waiting-time distributions for queues with multiple feedback and priorities,? Operat. Res.,17, No. 3, 519?525 (1969). · Zbl 0172.21803 · doi:10.1287/opre.17.3.519
[546] B. Epstein, ?Formulas for the mean time between failures and repairs of repairable redundant systems? (discussion of a paper by S. J. Einhorn: ?Reliability prediction for repairable redundant systems?); author’s reply, Proc. IEEE,53, No. 7, 731?732 (1965).
[547] S. Erlander, ?The remaining busy period for a single-server queue with Poisson input,? Operat. Res.,13, No. 5, 734?746 (1965). · Zbl 0147.16803 · doi:10.1287/opre.13.5.734
[548] S. Erlander, ?A note on telephone traffic with losses,? J. Appl. Probab.,4, No. 2, 406?408 (1967). · Zbl 0171.16203 · doi:10.1017/S0021900200032162
[549] A. M. O. Esogbue, ?Mathematical and computational approaches to some queueing processes arising in surgery,? Math. Biosci.,4, Nos. 3?4, 531?542 (1969). · doi:10.1016/0025-5564(69)90027-3
[550] R. V. Evans, ?Queueing when jobs require several services which need not be sequenced,? Management Sci.,10, No. 2, 298?315 (1964). · doi:10.1287/mnsc.10.2.298
[551] A. J. Fabens and A. G. A. D. Perera, ?A correction to ?The solution of queueing and inventory models by semi-Markov processes,?? J. Roy. Statist. Soc.,B25, No. 2, 455?456 (1963). · Zbl 0203.18202
[552] C. H. Falkner, ?Optimal ordering policies for a continuous-time deterministic inventory model,? Management Sci.,15, No. 11, 672?685 (1969). · Zbl 0179.24902 · doi:10.1287/mnsc.15.11.672
[553] W. Fieger ?Zwei Verallgemeinerungen der Palmschen Formeln,? Trans. Third Prague Conf. Information Theory, Statistical Decision Functions, and Random Processes, 1962, Prague (1964), pp. 107?122.
[554] W. Fieger, ?Eine für beliebige Call-Prozesse geltende Verallgemeinerung der Palmschen Formeln,? Math. Scand.,16, No. 2, 121?147 (1965). · Zbl 0138.11704 · doi:10.7146/math.scand.a-10753
[555] P. D. Finch, ?A coincidence problem in telephone traffic with nonrecurrent arrival process,? J. Austral. Math. Soc.,3, No. 2, 237?240 (1963). · Zbl 0142.14602 · doi:10.1017/S144678870002797X
[556] P. D. Finch, ?The single-server queueing system with nonrecurrent input process and Erlang service time,? J. Austral. Math. Soc.,3, No. 2, 220?236 (1963). · Zbl 0142.14603 · doi:10.1017/S1446788700027968
[557] P. D. Finch, ?A note on the queueing system GI|Ek|1,? J. Appl. Probab.,6, No. 3, 708?710 (1969). · Zbl 0208.22701
[558] P. D. Finch and C. Pearce, ?A second look at queueing systems with moving average input processes,? J. Austral. Math. Soc.,5, No. 1, 100?106 (1965). · Zbl 0142.14604 · doi:10.1017/S144678870002591X
[559] J. Finkelstein and R. Schafer, ?Dependability models for a system of N parallel elements,? Proc. Eighth Nat. Sympos. Reliability and Quality Control, Washington, D. C., 1962, Inst. Radio Engrs., New York (1962), pp. 434?441.
[560] D. Firescu and A. Muja, ?Asupra unei aplica?ii a sisteme lor de a?teptare cu prioritate absolut?,? An. Univ. Bucure?ti, Mat.-Mecan.,18, No. 2, 37?48 (1969).
[561] S. I. Firstman, ?Duration of a countdown when considered as an interrupted service process,? Operat. Res.,11, No. 2, 210?227 (1963). · Zbl 0121.13301 · doi:10.1287/opre.11.2.210
[562] J. Folkman and S. Port, ?Optimal procedures for stochastically failing equipment,? J. Appl. Probab.,3, No. 2, 521?537 (1966). · Zbl 0173.46603 · doi:10.1017/S0021900200114305
[563] R. Fortet, ?Définition générale des processus de service et éléments pour leur theorie,? Rev. Roumaine Math. Pures et Appl.,12, No. 9, 1235?1241 (1967).
[564] R. Fortet, ?Définition et lois de probabilité des répartitions ponctuelles aléatoires,? Zastosow. Mat.,10, 57?73 (1969).
[565] R. Fortet J. Déjean, and C. Grandjean, ?Temps de transition et contrôle d’un systéme on évolution,? Cahiers Centre Études Rech. Opérat.,7, Nos. 3?4, 151?176 (1965).
[566] F. G. Foster, ?Batched queueing processes,? Operat. Res.,12, No. 3, 441?449 (1964). · Zbl 0178.53601 · doi:10.1287/opre.12.3.441
[567] F. G. Foster, A. G. A. D. Perera, ?Queues with batch departures (II),? Ann. Math. Statist.,35, No. 3, 1147?1156 (1964). · Zbl 0232.60088 · doi:10.1214/aoms/1177703272
[568] M. Fraiture, ?Sur l’estimation ergodique du temps moyen de présence dans une file d’attente,? Bull. Soc. Roy. Sci. Liège,38, Nos. 5?6, 182?193 (1969).
[569] M. Fraiture, ?Sur l’estimation ergodique du temps moven de presénce dans une file d’attente, 2ème note,? Bull. Soc. Roy. Sci. Liége,39, Nos. 1?2, 14?21 (1970).
[570] H. Frank and S. L. Hakimi, ?Parametric synthesis of statistical communication nets,? Quart. Appl. Math.,27, No. 1, 105?120 (1969). · Zbl 0242.94002 · doi:10.1090/qam/256777
[571] O. Frank, ?The optimal order to serve in certain servicing problems,? Operat. Res.,12, No. 3, 433?440 (1964). · Zbl 0156.19005 · doi:10.1287/opre.12.3.433
[572] P. Franken, ?Asymptotische Untersuchung des Überlaufverkehrs,? Wiss. Z. Friedrich-Schiller-Univ. Math.-Naturwiss. Reihe,14, No. 5, 235?245 (1965).
[573] P. Franken, ?Erlangsche Formeln für semi-Markowschen Eingang,? Elektron. Informationsverarb. und Kybernet.,4, No. 3, 197?204 (1968). · Zbl 0169.49501
[574] P. Franken and J. Kerstan, ?Bedienungssysteme mit unendlich vielen Bedienungsapparaten,? Schrift. Inst. Math. Deutsch. Akad. Wiss. Berlin,B, No. 8, 67?76 (1968). · Zbl 0188.23603
[575] P. Franken, A. Liemant, and K. Matthes, ?Stationare zufällige Punktfolgen (III),? Jahresber. Deutsch. Math.-Ver.,67, No. 4, 183?202 (1965). · Zbl 0178.52901
[576] H. D. Freidman, ?Reduction methods for tandem queueing systems,? Operat. Res.,13, No. 1, 121?131 (1965). · Zbl 0143.40702 · doi:10.1287/opre.13.1.121
[577] Jiro Fukuta, ?Reliability considerations for a complex redundant system with generalized repair times,? Mem. Fac. Engng. Hiroshima Univ.,3, No. 2, 9?20 (1968).
[578] J. A. Gani, ?A note on the first emptiness of dams with Markovian inputs,? J. Math. Anal. Appl.,26, No. 2, 270?274 (1969). · Zbl 0175.17701 · doi:10.1016/0022-247X(69)90149-8
[579] J. A. Gani, ?Recent advances in storage and flooding theory,? Adv. Appl. Probab.,1, No. 1, 90?100 (1969). · Zbl 0183.49202 · doi:10.1017/S0001867800036910
[580] J. A. Gani and N. U. Prabhu, ?A storage model with continuous infinitely divisible inputs,? Proc. Cambridge Phil. Soc.,59, No. 2, 417?429 (1963). · Zbl 0199.23201 · doi:10.1017/S030500410003704X
[581] J. A. Gani and R. C. Srivastava, ?Some models for traffic congestion,? Transport. Res.,3. No. 3, 333?344 (1969). · doi:10.1016/S0041-1647(69)80018-3
[582] R. C. Garg, ?Le comportement d’un systéme du point de vue de sa securité,? Rev. Franc. Rech. Opérat.,7, No. 26, 83?87 (1963).
[583] R. C. Garg, ?Dependability of a complex system with general waiting time distributions,? IEEE Trans. Reliability,R-12, No. 3, 17?21 (1963). · doi:10.1109/TR.1963.5218212
[584] R. C. Garg, ?Dependability of a complex system having two types of components,? IEEE Trans. Reliability,R-12, No. 3, 11?16 (1963). · doi:10.1109/TR.1963.5218211
[585] M. Garlet, ?Disponibilités et défaillances d’un systéme homogéne de production, Premiére partie: Définition et étude analytique de modéle simple,? Rev. Statist. Appl.,17, No. 3, 31?60 (1969).
[586] W. E. Garthright, Jr., The Markov Channel-Joining Queue (Doctoral Dissertation), Duke Univ. (1968), 87 pages; Dissert. Abstr.,B29, No. 9, 3391?3393 (1969).
[587] J. L. Gastwirth, ?On a telephone traffic system with several kinds of service distributions,? J. Appl. Probab.,1, No. 1, 77?84 (1964). · Zbl 0131.17101 · doi:10.1017/S0021900200111568
[588] D. P. Gaver, Jr., ?Accommodation of second-class traffic,? Operat. Res.,11, No. 1, 72?87 (1963). · Zbl 0114.11801 · doi:10.1287/opre.11.1.72
[589] D. P. Gaver, Jr., ?Random hazard in reliability problems? Technometrics,5, No. 2, 211?226 (1963). · doi:10.1080/00401706.1963.10490076
[590] D. P. Gaver, Jr., ?Time to failure and availability of paralleled systems with repair,? IEEE Trans. Reliability,R-12, No. 2, 30?38 (1963). · doi:10.1109/TR.1963.5218202
[591] D. P. Gaver, Jr., ?Competitive queueing: idleness probabilities under priority disciplines,? J. Roy. Statist. Soc.,B25, No. 2, 489?499 (1963). · Zbl 0138.11803
[592] D. P. Gaver, Jr., ?Comparison of disciplines for queues subject to setups or orientations,? Proc. Third Internat. Conf. Operations Research, Oslo, 1963, Paris-London (1964), pp. 867?870.
[593] D. P. Gaver, Jr., ?A probability problem arising in reliability and traffic studies,? Operat. Res.,12, No. 4, 534?542 (1964). · Zbl 0135.20406 · doi:10.1287/opre.12.4.534
[594] D. P. Gaver, Jr., ?A comparison of queue disciplines when service orientation times occur,? Nav. Res. Log. Quart.,10, No. 3, 219?235 (1963). · Zbl 0124.34205 · doi:10.1002/nav.3800100118
[595] R. F. Gebhard, ?A limiting distribution of an estimate of mean queue length,? Operat. Res.,11, No. 6, 1000?1003 (1963). · Zbl 0141.16203 · doi:10.1287/opre.11.6.1000
[596] R. F. Gebhard, ?A queueing process with bilevel hysteretic service-rate control,? Nav. Res. Log. Quart.,14, No. 1, 55?67 (1967). · Zbl 0149.13902 · doi:10.1002/nav.3800140106
[597] M. A. Geisler, ?A study of inventory theory,? Management Sci.,9, No. 3, 490?497 (1963). · doi:10.1287/mnsc.9.3.490
[598] V. George, ?Disponibilité d’un atelier en fonction du stock de rechange,? Rev. Franc. Rech. Operat.,8, No. 30, 80?85 (1964).
[599] J. Gergely, ?Kiszolgáló rendzer álta-lános vizsgálata egy kiszolgáló berendezés esetén,? Tájékostató. Magyar Tud. Akad. Számitástech. Közp., No. 10, 118?137 (1966).
[600] J. Gergely, ?Egy sorbanállási feladat megoldása,? Közl. Magyar Tud. Akad. Számitástech. Közp.,2, 3?25 (1967).
[601] J. Gergely, ?A service system with switching,? Studia Sci. Math. Hung.,3, Nos. 1?3, 167?179 (1968).
[602] D. Gernert, H. J. Linn, and R. Marquardt, ?Ein mathematisches Verfahren zur Bestimmung der optimalen Belegung von Verkehrs-und Nachrichtennetzen,? Elektron. Rechenanlag.,11, No. 5, 272?275 (1969). · Zbl 0183.49403
[603] P. M. Ghare and G. F. Schrader, ?A model for an exponentially decaying inventory,? J. Indust. Engng.,14, No. 5, 238?243 (1963).
[604] G. C. Ghirtis, ?A system of two servers with limited waiting rooms and certain order of visits,? Biometrika,55, No. 1, 223?228 (1968). · Zbl 0157.25403 · doi:10.2307/2334466
[605] A. Ghosal, ?Queues with finite waiting time,? Operat. Res.,11, No. 6, 919?921 (1963). · Zbl 0124.34204 · doi:10.1287/opre.11.6.919
[606] A. Ghosal, ?Conjugate dams,? Colloq. on Applications of Mathematics to Economics, Budapest, 1963, Hung. Acad. Sci., Budapest (1965), pp. 115?119.
[607] A. Ghosal, ?Some aspects of queueing and storage systems,? Lect. Notes Operat. Res. and Math. Syst., Vol. 23 (1970), 93 pages.
[608] A. Ghosal, ?Some remarks about the duality relation in queues,? Acta Math. Acad. Sci. Hung.,19, Nos. 1?2, 163?170 (1968). · Zbl 0159.47201 · doi:10.1007/BF01894691
[609] M. Girault, ?Le processus ponctuel de Poisson? Cahiers Bur. Univ. Rech. Opérat., No. 5, 3?16 (1964).
[610] M. Girault, ?Processus ponctuels dans les modeles de files d’attente et de stockage,? Queueing Theory, London (1967), pp. 3?9.
[611] S. M. Giveen, ?A taxicab problem with time-dependent arrival rates,? SIAM Rev.,5, No. 2, 119?127 (1963). · Zbl 0117.13702 · doi:10.1137/1005031
[612] G. J. Glasser, ?The age replacement problem,? Technometrics,9, No. 1, 83?91 (1967). · doi:10.1080/00401706.1967.10490443
[613] B. V. Gnedenko, ?Sur le probleme de la réservation dans les systéms complexes,? Fourth Internat. Congr. Cybernetics, Namur, (1964), Namur(1967), pp. 346?352.
[614] B. V. Gnedenko, ?Some theorems on standbys,? Proc. Fifth Berkeley Sympos. Mathematical Statistics and Probability, 1965?66, Vol. 3, Berkeley-Los Angeles (1967), pp. 285?291.
[615] F. Göbel, ?Some queueing models with dependent service times,? Abstr. Bull. Internat. Statist. Inst.,41, No. 2, 841; discussion, 841?842 (1965).
[616] G. Dodini, ?O problem? de a?tept?re cu o singur? sta?ie de servire,? Studii ?i cercet?ri Mat. Acad. RPR,17, No. 5, 777?780 (1965).
[617] O. Godini, ?O problem? de teoria a?tept?rii cu servire eterogen?,? Studii ?i cercet?ri Mat. Acad. RPR,17, No. 5, 765?775 (1965).
[618] J. R. Goldman, Stochastic Point Processes: Limit Theorems and Infinite Divisibility (Doctoral Dissertation), Princeton Univ. (1965), 74 pages; Dissert. Abstr.,26, No. 12, Part 1, 7335?7336 (1966).
[619] W. J. Gordon and G. F. Newell, ?Equilibrium analysis of a stochastic model of traffic flow,? Proc. Cambridge Phil. Soc.,60, No. 2, 227?236 (1964). · Zbl 0117.36101 · doi:10.1017/S0305004100037695
[620] W. J. Gordon Jr., Interactions in Closed Queueing Systems (Doctoral Dissertation), Brown Univ. (1965), 56 pages; Dissert. Abstr.,26, No. 6, 3367 (1965).
[621] J. Goudriaan, ?Another note on the delay problem in crossing a traffic stream,? Statist. Nederl.,18, No. 3, 259?265 (1964). · doi:10.1111/j.1467-9574.1964.tb00513.x
[622] A. K. Govil, ?Dependability of a complex system with general repair distribution under preemptive priority resume,? Z. Angew. Math. and Mech.,50, No. 8, 499?501 (1970). · Zbl 0241.60090 · doi:10.1002/zamm.19700500711
[623] H. Greenberg and I. Greenberg, ?The number served in a queue,? Operat. Res.,14, No. 1, 137?144 (1966). · Zbl 0142.14504 · doi:10.1287/opre.14.1.137
[624] I. Greenberg, ?The behavior of a simple queue at various times and epochs,? SIAM Rev.,9, No. 2, 234?248 (1967). · Zbl 0154.19102 · doi:10.1137/1009039
[625] I. Greenberg, ?Some duality results in the theory of queues,? J. Appl. Probab.,6, No. 1, 99?121 (1969). · Zbl 0181.46705 · doi:10.1017/S0021900200032563
[626] G. Gregory and P. R. Satyamurty, ?A note on the queueing system M|M|1 with balking,? Biometrika,52, Nos. 3?4, 643?645 (1965). · Zbl 0137.36002 · doi:10.1093/biomet/52.3-4.643
[627] B. Grunebaum, ?Theory of successive service calls,? Indust. Math.,13, No. 2, 1?22 (1963).
[628] S. K. Gupta, ?Queues with batch Poisson arrivals and a general class of service-time distributions,? J. Indust. Engng.,15, No. 6. 319?320 (1964).
[629] S. K. Gupta, ?Queues with mixed-Erlangian input and negative exponential service-time distribution with finite waiting space,? CORS Journal,3, No. 1, 22?28 (1965). · Zbl 0138.41002
[630] S. K. Gupta, ?Queues fed by Poisson input and hyper-mixed Erlangian service-time distribution with finite waiting space,? Unternehmensforschung,9, No. 2, 80?90 (1965). · Zbl 0141.34301
[631] S. K. Gupta, ?Queues with Poisson input and mixed Erlangian service-time distribution with finite waiting space,? J. Operat. Res. Soc. Japan,8, No. 1, 24?31 (1965). · Zbl 0142.14505
[632] S. K. Gupta, ?Some queues with hypergeneral service-time distributions,? CORS Journal,3, No. 2, 90?95 (1965).
[633] S. K. Gupta and J. K. Goyal, ?Queues with Poisson input and hyperexponential output with finite waiting space,? Operat. Res.,12, No. 1, 75?81 (1964). · Zbl 0124.09101 · doi:10.1287/opre.12.1.75
[634] S. K. Gupta and J. K. Goyal, ?Queues with hyper-Poisson input and exponential output with finite waiting space,? Operat. Res.,12, No. 1, 82?88 (1964). · Zbl 0124.09102 · doi:10.1287/opre.12.1.82
[635] S. K. Gupta and J. K. Goyal, ?Queueing system M|M|? with given initial state probability distributions,? Labdev. J. Sci. and Technol.;2, No. 1, 61?63 (1964).
[636] S. K. Gupta and J. K. Goyal, ?Queues with batch Poisson arrivals and hyperexponential service-time distribution,? Metrika,10, No. 3, 171?178 (1966). · Zbl 0154.19105 · doi:10.1007/BF02613429
[637] S. K. Gupta and J. K. Goyal, ?Queues with batch Poisson arrivals and hyperexponential service,? Nav. Res. Log. Quart.,12, Nos. 3?4, 323?329 (1965). · Zbl 0143.40603 · doi:10.1002/nav.3800120308
[638] H. M. Gurk and J. Minker, ?Storage requirements for information handling centers,? J. Assoc. Comput. Mach.,17, No. 1, 65?77 (1970). · Zbl 0197.15302 · doi:10.1145/321556.321563
[639] B. T. Guseinov, ?On a generalization of Kovalenko’s theorem,? Materials of the Internat. Teletraffic Congr., Munich (1970).
[640] N. Hadidi and B. W. Conolly, ?On the improvement of the operational characteristics of single-server queues by the use of a queue-length-dependent service mechanism,? Appl. Statist.,18, No. 3, 229?240 (1969). · doi:10.2307/2346583
[641] F. A. Haight, ?The discrete busy period distribution for various single-server queues,? Zastosow. Mat.,8, No. 1, 37?46 (1965). · Zbl 0137.35904
[642] M. Halperin, ?Some waiting-time distributions for redundant systems with repair,? Technometrics,6, No. 1, 27?40 (1964). · Zbl 0218.60088 · doi:10.1080/00401706.1964.10490145
[643] H. Hanisch and W. Hirsch, ?Properties of a transient queue,? Commun. Pure and Appl. Math.,16, No. 4, 487?503 (1964). · Zbl 0133.11304 · doi:10.1002/cpa.3160160408
[644] H. Hanisch and W. Hirsch, ?On a functional equation arising in the theory of queues,? Commun. Pure and Appl. Math.,16, No. 3, 267?277 (1963). · Zbl 0134.35201 · doi:10.1002/cpa.3160160305
[645] H. Hanisch and W. Hirsch, ?Note on the busy period in the case of infinite means,? Commun. Pure and Appl. Math.,17, No. 2, 245?249 (1964). · Zbl 0127.35104 · doi:10.1002/cpa.3160170208
[646] C. M. Harris, ?A queueing system with multiple service-time distributions,? Nav. Res. Log. Quart.,14, No. 2, 231?239 (1967). · Zbl 0156.18506 · doi:10.1002/nav.3800140208
[647] C. M. Harris, Queues with State-Dependent Stochastic Service Rates (Doctoral Dissertation), Polytech. Inst. Brooklyn (1966), 93 pages; Dissert. Abstr.,B27, No. 6, 2027?2028 (1966).
[648] C. M. Harris, ?Queues with multiple Poisson input,? J. Indust. Engng.,17, No. 9, 454?460 (1966).
[649] A. M. Hasofer, ?A dam with inverse Gaussian input,? Proc. Cambridge Phil. Soc.,60, No. 4, 931?933 (1964). · Zbl 0137.38403 · doi:10.1017/S0305004100038391
[650] A. M. Hasofer, ?On the single-server queue with nonhomogeneous Poisson input and general service time,? J. Appl. Probab.,1, No. 2, 369?384 (1964). · Zbl 0134.14502 · doi:10.1017/S0021900200108460
[651] A. M. Hasofer, ?On the distribution of the time to first emptiness of a store with stochastic input,? J. Austral. Math. Soc.,4, No. 4, 506?517 (1964). · Zbl 0146.41301 · doi:10.1017/S1446788700025337
[652] A. M. Hasofer, ?Some perturbation results for the single-server queue with Poisson input,? J. Appl. Probab.,2, No. 2 462?466 (1965). · Zbl 0141.16001 · doi:10.1017/S0021900200108782
[653] N. A. J. Hastings, ?A stochastic model for Weibull failures as an aid to forecasting replacement requirements,? Proc. Inst. Mech. Engrs.,182, No. 34, 715?724 (1967?68). · doi:10.1243/PIME_PROC_1967_182_054_02
[654] A. G. Hawkes, ?Queueing for gaps in traffic,? Biometrika,52, Nos. 1?2, 79?85 (1965). · Zbl 0142.17803 · doi:10.1093/biomet/52.1-2.79
[655] A. G. Hawkes, ?Time-dependent solution of a priority queue with bulk arrival,? Operat. Res.,13 No. 4, 586?595 (1965). · Zbl 0134.14403 · doi:10.1287/opre.13.4.586
[656] A. G. Hawkes, ?Delay at traffic intersections,? Roy. Statist. Soc.,B28, No. 1, 202?212 (1966). · Zbl 0144.43601
[657] A. G. Hawkes, ?Gap acceptance in road traffic,? J. Appl. Probab.,5, No. 1, 84?92 (1968). · Zbl 0162.23403 · doi:10.1017/S0021900200032319
[658] R. H. Hayes, ?Statistical estimation problems in inventory control,? Management Sci.,15, No. 11, 686?701 (1969). · Zbl 0181.23002 · doi:10.1287/mnsc.15.11.686
[659] C. R. Heathcote, ?On the maximum of the queue GI|M|1,? J. Appl. Probab.,2, No. 1, 206?214 (1965). · Zbl 0132.38403 · doi:10.1017/S0021900200031697
[660] C. R. Heathcote and P. Winer, ?An approximation for the moments of waiting times,? Operat. Res.,17, No. 1 175?186 (1969). · Zbl 0165.52801 · doi:10.1287/opre.17.1.175
[661] J. C. Heffer, ?Steady-state solution of the M|Ek|c(?, FIFO) queueing system,? CORS Journal,7, 16?30 (1969).
[662] J. Henderson and D. Finch, ?A note on the queueing system Ek|G|1,? J. Appl. Probab.,7, No. 2, 473?475 (1970). · Zbl 0207.48801
[663] W. Henderson, ?GI|M|1 priority queue,? Operat. Res.,17, No. 5, 907?910 (1969). · Zbl 0184.23401 · doi:10.1287/opre.17.5.907
[664] B. Heskia, Etude des files d’attente dans une station á r postes; application a la recherche du nombre optimal de postes a creer sous l’hypothes de constance du taux d’intérêt (Doctoral Dissertation), Fac. Sci. Univ. Lyon (1962), 43-pages.
[665] C. C. Heyde, ?On the stationary waiting-time distribution in the queue GI|G|1,? J. Appl. Probab.,1, No. 1, 173?176 (1964). · Zbl 0131.17002
[666] C. C. Heyde, ?On some mixing sequences in queueing theory,? Operat. Res.,18, No. 2, 312?315 (1970). · Zbl 0196.23302 · doi:10.1287/opre.18.2.312
[667] D. P. Heyman, ?A priority queueing system with server interference,? SIAM J. Appl. Math.,17, No. 1, 74?82 (1969). · Zbl 0172.21701 · doi:10.1137/0117007
[668] D. K. Hildebrand, ?Stability of finite queue, tandem server systems,? J. Appl. Probab.,4, No. 3, 571?583 (1967). · Zbl 0157.25302 · doi:10.1017/S0021900200025559
[669] L. S. Hill, ?The application of queueing theory to the span of control,? J. Acad. Management,6, 1, 58?69 (1963). · doi:10.2307/254877
[670] F. S. Hillier, R. W. Conway, and W. L. Maxwell, ?A multiple-server queueing model with state-dependent service rate,? J. Indust. Engng.,15, No. 3, 153?157 (1964).
[671] D. Hochstädter, Stochastische Lagerhaltungsmodelle, Springer, Berlin-Heidelberg-New York (1969), 6, + 269 pages; Deutsch. Bibliogr.,A, No. 28, 2099 (1969).
[672] V. Hodgson, ?The time to drive through a no-passing zone,? Transport. Sci.,2, No. 3, 252?264 (1968). · doi:10.1287/trsc.2.3.252
[673] Tsuruchiyo Homma and Satoki Ninomija, ?Some results for queueing system M|M|s(N+s),? Yokohama Math. J.,14, Nos. 1?2, 1?16 (1966). · Zbl 0149.13901
[674] J. A. Hooke, ?On some limit theorems for the GI|G|1 queue,? J. Appl. Probab.,7, No. 3, 634?640 (1970). · Zbl 0206.22403 · doi:10.1017/S0021900200110599
[675] W. A. Horn, ?Allocating service periods to minimize delay time,? J. Res. Nat. Bur. Standards,B72, No. 3, 215?227 (1968). · Zbl 0236.60068
[676] S. J. Hornyak, ?Mathematical interrelationship between reliability and maintainability in various system models,? IEEE Trans. Applications and Industry,AI-83, No. 75, 413?420 (1964). · doi:10.1109/TAI.1964.5407714
[677] Jiunn Hsu, ?A continuation of delay-dependent queue disciplines,? Operat. Res.,18, No. 4, 733?738 (1970). · Zbl 0212.51603 · doi:10.1287/opre.18.4.733
[678] J. J. Hunter, ?On the renewal density matrix of a semi-Markov process,? Sankhya,A31, No. 3, 281?308 (1969). · Zbl 0186.51102
[679] G. Iazeolla, ?Sistemi a partizione-di-tempo: sviluppo teorico di un algoritmo di servizio con priorita,? Calcolo, 5, No. 2, 251?272 (1968). · Zbl 0196.20203 · doi:10.1007/BF02576110
[680] D. L. Iglehart, ?Limit theorems for queues with traffic intensity one,? Ann. Math. Statist.,36, No. 5, 1437?1449 (1965). · Zbl 0158.36105 · doi:10.1214/aoms/1177699903
[681] D. L. Iglehart, ?Limiting diffusion approximations for the many-server queue and the repairman problem,? J. Appl. Probab.,2, No. 2, 429?441 (1965). · Zbl 0216.47204 · doi:10.1017/S0021900200108745
[682] D. L. Iglehart and W. Whitt, ?Multiple-channel queues in heavy traffic (I),? Adv. Appl. Probab.,2 No. 1, 150?177 (1970). · Zbl 0218.60098 · doi:10.1017/S0001867800037241
[683] D. L. Iglehart and W. Whitt, ?Multiple-channel queues in heavy traffic, II: Sequences, networks, and batches,? Adv. Appl. Probab.,2, No. 2, 355?369 (1970). · Zbl 0206.22503 · doi:10.1017/S0001867800037435
[684] J. P. Imjof, ?Sur le nombre d’unités servies lors d’une période de service ininterrompu pour une file d’attente simple,? Publ. Inst. Statist. Univ. Paris,13, No. 4, 181?190 (1964).
[685] P. Iscovici and G. Godini, ?Linie de a?teptare cu sta?ii de servire prioritare,? Commun. Acad. RPR,13, No. 10, 871?878 (1963).
[686] P. Iscovici and G. Godini, ?Line de a?teptare cu num?r limitat de selicitan?i ?i servire în faze,? Studii si Cercet?ri Mat. Acad. RPR17, No. 5, 747?752 (1965).
[687] J. R. Jackson, ?Jobshop-like queueing systems,? Management Sci.,10, No. 1, 131?142 (1963). · doi:10.1287/mnsc.10.1.131
[688] H. Jacobi, ?Eine Unempfindlichkeitseigenschaft für geordnete Bündel ungeordneter Teil Bündel,? Wiss. Z. Friedrich-Schiller-Univ. Math.-Naturwiss. Reihe,14, No. 5, 251?260 (1965). · Zbl 0171.39305
[689] F. Jacobs, Probleme der stochastischen Theorie des Verkehrsablau des auf Strassen (Engineering Doctoral Dissertation), Univ. Stuttgart (1969).
[690] H. C. Jain, ?Queueing problem with limited waiting space,? Nav. Res. Log. Quart.,9, Nos. 3?4, 245?252 (1962). · Zbl 0109.36602 · doi:10.1002/nav.3800090307
[691] H. C. Jain, ?An inventory problem applied to a rental situation,? Austral. J. Statist.,8, No. 3, 154?162 (1966). · Zbl 0142.17102 · doi:10.1111/j.1467-842X.1966.tb00265.x
[692] H. C. Jain, ?Reliability of a complex system with two types of subsystems,? Logist. Rev.,3, No. 11, 21?37 (1967).
[693] N. K. Jaiswal, Priority Queues, Academic Press, New York (1968), 9, 239 pages.
[694] N. K. Jaiswal and K. Thiruvengadam, ?Simple machine interference with two types of failure,? Operat. Res.,11, No. 4, 624?636 (1963). · Zbl 0113.34603 · doi:10.1287/opre.11.4.624
[695] N. K. Jaiswal and K. Thiruvengadam, ?Finite-source priority queues,? SIAM J. Appl. Math.,15, 1278?1293 (1967). · Zbl 0155.24803 · doi:10.1137/0115111
[696] B. Jansson, ?Choosing a good appointment system ? a study of queues of the type (D, M, 1),? Operat. Res.,14, No. 2, 292?312 (1966). · Zbl 0154.43403 · doi:10.1287/opre.14.2.292
[697] J. H. Jenkins, ?On the correlation structure of the departure process of the M|E|1 queue,? J. Roy. Statist. Soc.,B28, No. 2, 336?344 (1966). · Zbl 0141.34203
[698] J. H. Jenkins, ?Stationary joint distributions arising in the analysis of the M|G|1 queue by the method of the imbedded Markov chain,? J. Appl. Probab.,3, No. 2, 512?520 (1966). · Zbl 0171.39302 · doi:10.1017/S0021900200114299
[699] A. Joffe and P. E. Ney, ?Convergence theorems for multiple-channel loss probabilities,? Ann. Math. Statist.,34, No. 1, 260?273 (1963). · Zbl 0121.13303 · doi:10.1214/aoms/1177704263
[700] F. I. John, ?Single-server queues with dependent service and interarrival times,? J. Soc. Indust. and Appl. Math.,11, No. 3, 526?534 (1963). · Zbl 0149.13803 · doi:10.1137/0111038
[701] F. I. John, ?Infinite-capacity storage processes,? J. Austral. Math. Soc.,6, No. 1, 30?35 (1966). · Zbl 0158.38702 · doi:10.1017/S1446788700003979
[702] B. M. Johnson, ?The ergodicity of series queues with general priorities,? Ann. Math. Statist.,36, No. 6, 1664?1676 (1965). · Zbl 0147.16604 · doi:10.1214/aoms/1177699795
[703] D. P. Johnson, ?On a class of stochastic processes with two states and continuous time parameter,? Trans. Amer. Math. Soc.,142, 257?267 (1969). · doi:10.1090/S0002-9947-1969-0246383-4
[704] B. H. de Jongh, ?Reduction of the probability-of-ruin equation to a renewal equation,? Bull. Deutsch. Ges. Versicherungsmath.,8, No. 4, 603?609 (1968). · Zbl 0165.22806
[705] P. Jumonville and W. G. Lesso, ?Determining the mean time to failure for certain redundant systems,? AIIE Trans.,1, No. 1, 81?82 (1969). · doi:10.1080/05695556908974418
[706] D. G. Kabe, ?On a formula useful in queueing theory,? CORS Journal,6, No. 1, 59?61 (1968). · Zbl 0164.48104
[707] S. Karlin and A. J. Fabens, ?A stationary inventory model with Markovian demand,? Mathematical Methods in the Social Sciences, 1959, Stanford Univ. Press, Palo Alto (1960), pp. 159?175.
[708] S. Karlin and A. J. Fabens, ?Generalized renewal functions and stationary inventory models,? J. Math. Anal. and Appl., No. 3, 461?487 (1962). · Zbl 0203.22104 · doi:10.1016/0022-247X(62)90019-7
[709] B. R. Kashyap, ?A double-ended queueing system with limited waiting space,? Proc. Nat. Inst. Sci. India,A31, No. 6, 559?570 (1965?66). · Zbl 0149.13602
[710] B. R. Kashyap, ?The random walk with partially reflecting barriers with application to queueing theory,? Proc. Nat. Inst. Sci. India,A31, No. 6, 527?535 (1965?66). · Zbl 0149.13601
[711] Tomo-O. Kawamura, ?Transient behavior of Poisson queue,? J. Operat. Res. Soc. Japan,7, No. 2, 76?92 (1964). · Zbl 0133.41001
[712] J. Keilson, ?On the asymptotic behaviour of queues,? J. Roy. Statist. Soc.,B25, No. 2, 464?476 (1963). · Zbl 0133.41003
[713] J. Keilson, ?Some comments on single-server queueing methods and some new results,? Proc. Cambridge Phil. Soc.,60, No. 2, 237?251 (1964). · Zbl 0149.13804 · doi:10.1017/S0305004100037701
[714] J. Keilson, ?The general bulk queue as a Hilbert problem (corrigendum),? J. Roy. Statist. Soc.,B26, No. 3, 487 (1964).
[715] J. Keilson, J. Cozzolino, and H. Young, ?A service system with unfilled requests repeated,? Operat. Res.,16, No. 6, 1126?1137 (1968). · Zbl 0165.52703 · doi:10.1287/opre.16.6.1126
[716] C. D. Kemp. ??Stuttering-Poisson? distributions,? J. Statist. and Social Inquiry Soc. Ireland,21, No. 5, 151?157 (1966?67).
[717] D. G. Kendall, ?Renewal sequences and their arithmetic,? Lect. Notes Math.,31, 147?175 (1967). · Zbl 0178.19803 · doi:10.1007/BFb0061116
[718] J. Kerstan, ?Teilprozesse Poissonscher Prozesse,? Trans. Third Prague Conf. Information Theory, Statistical Decision Functions and Random Processes, 1962, Prague (1964), pp. 377?403.
[719] J. Kerstan and H. Debes, ?Zufällige Punktfolgen und Markoffsche Übergangsmatrizen ohne stationare Verteilungsgesetze,? Wiss. Z. Friedrich-Schiller-Univ. Math.-Naturwiss. Reihe,18, No. 2, 349?359 (1969).
[720] J. Kerstan and K. Matthes, ?Verallgemeinerung eines Satzes von Sliwnjak,? Rev. Roumaine Math. Pures et Appl.,9, No. 9, 811?829 (1964). · Zbl 0192.24801
[721] J. Kerstan and K. Matthes, ?Stationäre zufällige Punktfolgen (II),? Jahresber. Deutsch. Math., Ver.,66, 106?118 (1964). · Zbl 0178.52804
[722] J. F. C. Kingman, ?On queues in heavy traffic,? J. Roy. Statist. Soc.,B24, No. 2, 383?392 (1962). · Zbl 0127.10003
[723] J. F. C. Kingman, ?Some inequalities for the queue GI|G|1,? Biometrika,49, Nos. 3?4, 315?324 (1962). · Zbl 0122.13802 · doi:10.1093/biomet/49.3-4.315
[724] J. F. C. Kingman, ?Poisson counts for random sequences of events,? Ann. Math. Statist.,34, No. 4, 1217?1232 (1963). · Zbl 0123.35603 · doi:10.1214/aoms/1177703857
[725] J. F. C. Kingman, ?A martingale inequality in the theory of queues,? Proc. Cambridge Phil. Soc.,60, No. 2, 359?361 (1964). · Zbl 0127.10004 · doi:10.1017/S0305004100037841
[726] J. F. C. Kingman, ?On continuous-time models in the theory of dams,? J. Austral. Math. Soc.,3, No. 4, 480?487 (1963). · Zbl 0217.50604 · doi:10.1017/S1446788700039100
[727] J. F. C. Kingman, ?On doubly stochastic Poisson processes,? Proc. Cambridge Phil. Soc.,60, No. 4, 923?930 (1964). · Zbl 0134.14108 · doi:10.1017/S030500410003838X
[728] J. F. C. Kingman, ?On the algebra of queues,? J. Appl. Probab.,3, No. 2, 285?326 (1966). · Zbl 0152.16604 · doi:10.1017/S0021900200114160
[729] J. F. C. Kingman, ?Approximations for queues in heavy traffic,? Queueing Theory, London (1967), pp. 73?77; discussion: pp. 77?78.
[730] L. Kleinrock, ?Analysis of a time-shared processor,? Nav. Res. Log. Quart.,11, No. 1, 59?73 (1964). · Zbl 0129.30902 · doi:10.1002/nav.3800110105
[731] L. Kleinrock ?A delay-dependent queue discipline,? Nav. Res. Log. Quart.,11, No. 4, 329?341 (1964). · Zbl 0137.11906 · doi:10.1002/nav.3800110306
[732] E. Knauer, ?Über die Verteilung der zufälligen Lebenszeit bei einem zuverlässigkeitstheoretischen Systemmodell mit reparaturfähigen Elementen,? Elektron. Informationsverarb. und Kybernet.,5, No. 2, 91?96 (1969). · Zbl 0179.25105
[733] J. Koerts, ?On mean waiting times and their reduction by priority procedures: an expository survey and some tables,? Statist. Neerl.,17, No. 3, 267?283 (1963). · doi:10.1111/j.1467-9574.1963.tb01045.x
[734] A. G. Konheim, ?The stationary waiting-time distribution for a single-server queue,? J. Soc. Indust. Appl. Math.,13, No. 4, 966?976 (1965). · Zbl 0143.20305 · doi:10.1137/0113064
[735] A. G. Konheim, ?A note on time sharing with preferred customers,? Z. Wahrscheinlichkeitstheor. und. Verw. Geb.,9, No. 2, 112?130 (1968). · Zbl 0155.24701 · doi:10.1007/BF01851002
[736] D. König and K. Matthes, ?Verallgemeinerungen der Erlangschen Formeln (I),? Math. Nachr.,26, Nos. 1?4, 45?56 (1963). · Zbl 0119.14803 · doi:10.1002/mana.19630260105
[737] D. König, K. Matthes, and K. Nawrotzki, Verallgemeinerungen der Erlangschen und Engsetschen Formeln, Akad. Verl., Berlin (1967), 123 pages.
[738] I. Kopoci?ska, ?On a M|G|1 queueing model with feedback,? Zastosow. Mat.,9, No. 2, 161?171 (1967).
[739] I. Kopoci?ska, ?O pewnym modelu z teorii kolejek z uwzglednieniem zniecierpliwienia klientów,? Zastosow. Mat.,7, No. 1, 41?50 (1963).
[740] I. Kopoci?ska and B. Kopoci?ski, ?Rozklady odstepów miedzy zmianami stanu w systemie M|G|1 ze sprze?eniem zwrotnym,? Zastosow. Mat.,9, No. 3, 219?226 (1968).
[741] B. Kopoci?ski, ?On a model of a queue with delayed feedback,? Zastosow. Mat.,7, No. 1, 51?57 (1963).
[742] B. Kopoci?ski, ?On the sequence of facility installation,? Zastosow. Mat.,11, No. 2, 131?136 (1970).
[743] B. Korte and W. Oberhofer, ?Ein stochastisches Maschinenbelegungsproblem,? Z. Angew. Math. Mech.,50, Nos. 1?4, 18?19 (1970). · doi:10.1002/zamm.19700500113
[744] T. C. Kotiah, J. W. Thompson, and W. A. O. Waugh, ?Use of Erlangian distributions for single-server queueing systems,? J. Appl. Probab.,6, No. 3, 584?593 (1969). · Zbl 0191.50203 · doi:10.1017/S0021900200026632
[745] Z. Koutský, ?Probability of a service system’s ruin in the case of finite initial capital,? Trans. Fourth Prague Conf. Information Theory, Statistical Decision Functions, and Random Processes, 1965, Prague (l967), pp. 425?433.
[746] H. Kremser, ?Ein Serviceproblem mit Abhängigkeit zwischen Warteschlange und Servicezeit,? Österreich. Ingr.-Arch.,17, No. 3, 193?200 (1963). · Zbl 0171.16303
[747] H. Kremser, ?Wartezeiten und Warteschlangen bei Eingädelung eines Poissonprozesses in eines anderen solchen Prozess,? Österreich. Ingr.-Arch.,18, Nos. 3?4, 269?274 (1964). · Zbl 0134.35105
[748] B. Krishnamoorthi, ?On Poisson queue with two heterogeneous servers,? Operat. Res.,11, No. 3, 321?330 (1963). · Zbl 0173.20101 · doi:10.1287/opre.11.3.321
[749] B. Krishnamoorthi, ?On the concept of FIFOV in queues,? Operat. Res.,13, No. 3, 365?374 (1965). · Zbl 0144.40307 · doi:10.1287/opre.13.3.365
[750] L. Kubat, ?Note on the reliability of parallel redundant systems,? Trans. Third Prague Conf. Information Theory, Statistical Decision Functions, and Random Processes,? 1962, Prague (1964), pp. 453?460.
[751] D. K. Kulsherestha, ?Analytic study of a complex system with regard to dependability having two types of components and general repair-time distribution? Labdev. J. Sci. and Technol., 3, No. 2, 92?103 (1965).
[752] G. Kummer and K. Matthes, ?Verallgemeinerung eines Satzes von Sliwnjak (II),? Rev. Rouman. Math. Appl.,15, No. 6, 845?870 (1970). · Zbl 0206.19003
[753] H. Kushnev, ?Stochastic stability and the design of feedback controls,? Proc. Sympos. Systems Theory, New York, 1965, Polytech. Press, Brooklyn (1965), pp. 177?195.
[754] J.-P. Lambotte, ?Processus semi-Markoviens et files d’attente,? Cahiers Centre Études Rech. Opérat.,10, No. 1, 21?31 (1968). · Zbl 0164.48201
[755] J.-P. Lambotte and J. Teghem, ?Utilisation de la théorie des processus semi-Markoviens dans l’etude de problémes de files d’attente,? Queueing Theory, London (1967), pp. 61?64.
[756] J. Lamperti, ?Semistable stochastic processes,? Trans. Amer. Math. Soc.,104, No. 1, 62?78 (1962). · Zbl 0286.60017 · doi:10.1090/S0002-9947-1962-0138128-7
[757] W. Lampkin, ?The expected size of an order in an (s, S, T) policy with Poisson demand? Operat. Res. Quart.,17, No. 1, 91?93 (1966). · doi:10.1057/jors.1966.11
[758] B. Lannuzel and J.-P. Raoult, ?Processus ponctuels absolutment continus,? Compt. Rend.,269, No. 17, A781-A783 (1969). · Zbl 0265.60041
[759] A. J. Lawrance, ?Selective interaction of a Poisson and renewal process: first-order stationary point results? J. Appl. Probab.,7, No. 2, 359?372 (1970). · Zbl 0198.22304 · doi:10.1017/S0021900200034938
[760] A. J. Lawrance, ?Selective interaction of a stationary point process and a renewal process,? J. Appl. Probab.,7, No. 2, 483?489 (1970). · Zbl 0198.22303 · doi:10.1017/S0021900200035105
[761] M. R. Leadbetter, ?On streams of events and mixtures of streams,? J. Roy. Statist. Soc.,B28, No. 1, 218?227 (1966). · Zbl 0152.16801
[762] M. R. Leadbetter, ?On three basic results in the theory of stationary point processes,? Proc. Amer. Math. Soc.,19, No. 1, 115?117 (1968). · Zbl 0159.46202 · doi:10.1090/S0002-9939-1968-0221584-4
[763] M. R. Leadbetter, ?On the distributions of the times between events in a stationary stream of events,? J. Roy. Statist. Soc.,B31, No. 2, 295?302 (1969).
[764] C. T. H. Lee and A. Dushman, ?New results in effectiveness prediction for Markovian systems,? Proc. Ann. Sympos. Reliability, Los Angeles, 1970, New York (1970), pp. 410?419.
[765] E. L. Leese, ?Numerical methods of determining the transient behaviour of queues with variable arrival rate,? Queueing Theory, London (1967), pp. 86?97; discussion: 97.
[766] E. L. Leese and D. W. Boyd, ?Numerical methods of determining the transient behaviour of queues with variable arrival rates,? CORS Journal,4, No. 1, 1?13 (1966). · Zbl 0143.20401
[767] F. F. Leimkuhler and J. G. Cox, ?Compact book storage in libraries,? Operat. Res.,12, No. 3, 419?427 (1964). · doi:10.1287/opre.12.3.419
[768] R. T. Leslie, ?Recurrence times of clusters of Poisson points,? J. Appl. Probab.,6, No. 2, 372?388 (1969). · Zbl 0191.47201 · doi:10.1017/S0021900200032885
[769] R. Lewandowski, ?Zur Theorie der Warteschlangen? (Part 2), Elektron.-Datenverarb.,8, No. 4, 208?218 (1966).
[770] R. Lewandowski, ?Zur Theorie der Warteschlangen? (Part 3), Elektron.-Datenverarb.,8, No. 5, 251?263 (1966).
[771] T. Lewis, ?Evaluation of the queue-length distribution for some queues with correlated inputs,? Nature,221, No. 5033, 1106?1107 (1966). · Zbl 0147.16801 · doi:10.1038/2111106a0
[772] T. Lewis and L. J. Govier, ?Some properties of counts of events for certain types of point process,? J. Roy. Statist. Soc.,B26, No. 2, 325?337 (1964). · Zbl 0128.37603
[773] T. Lewis and G. F. Newell, ?Products of zero-one processes and the multilane highway crossing problem? J. Math. Anal., and Appl., 16, No. 1, 51?64 (1966). · Zbl 0141.35903 · doi:10.1016/0022-247X(66)90185-5
[774] A. Liemant, ?Invariante zufällige Punktfolgen,? Wiss. Z. Friedrich-Schiller-Univ. Math.-Naturwiss. Reihe,18, No. 2, 361?372 (1969). · Zbl 0265.60082
[775] G. Lind, ?Accurary of traffic measurements in a Poisson traffic process; arbitrary distribution of intervals between observations and fixed number of observations,? Ericsson Tech.,25, No. 4, 211?246 (1969).
[776] E. H. Lloyd, ?The epochs of emptiness of a semi-infinite discrete reservoir,? J. Roy. Statist. Soc.,B25, No. 1, 131?136 (1963). · Zbl 0114.11902
[777] E. H. Lloyd and S. Odoom ?A note on the solution of dam equations,? J. Roy. Statist. Soc.,B26, No. 2, 338?344 (1964). · Zbl 0123.35803
[778] J. Loris-Teghem, ?Condition nécessaire d’ergodisme pour un processus stochastique lie á un systeme d’attente á arrivées et services en groupes d’effectif aléatoire,? Bull. Cl. Sci. Acad. Roy. Belg.,52, No. 3, 382?389 (1966).
[779] J. Loris-Teghem, ?Un systéme d’attente a arrivées et services en groupes d’effectif aléatoire,? Cahiers Centre Etudes Rech. Opérat.,8, No. 3, 179?193 (1966).
[780] J. Loris-Teghem, ?Une application d’un théoreme de G. Baxter a la détermination de la distribution des temps d’attente dans un modele GI|G|1 généralisé,? Cahiers Centre Études Rech. Opérat.,10, No. 2, 79?83 (1968).
[781] R. F. Love, ?A note on the properties of the queueing system M|Ek|1,? CORS Journal,6, No. 2, 115?118 (1968). · Zbl 0164.48003
[782] R. M. Loynes, ?The stability of a queue with nonindependent interarrival and service times,? Proc. Cambridge Phil. Soc.,58, No. 3, 497?520 (1962). · Zbl 0203.22303 · doi:10.1017/S0305004100036781
[783] R. M. Loynes, ?The stability of a system of queues in series,? Proc. Cambridge Phil. Soc.,60, No. 3, 569?574 (1964). · Zbl 0173.45802 · doi:10.1017/S0305004100038044
[784] R. M. Loynes, ?On the waiting-time distribution for queues in series,? J. Roy. Statist. Soc.,B27, No. 3, 491?496 (1965). · Zbl 0141.16002
[785] R. M. Loynes, ?On a property of the random walks describing simple queues and dams,? J. Roy. Statist. Soc.,B27, No. 1, 125?129 (1965). · Zbl 0138.41001
[786] O. Macchi, ?Processus ponctuels et multicoincidences,? Compt. Rend.,268, No. 26, A1616-A1619 (1969). · Zbl 0181.44205
[787] C. Mack, ?The equivalence of assuming exponential service times to assuming an unrealistic queue discipline and how to take advantage of this,? Colloq. Application of Mathematics to Economics, Budapest, 1963, Hung. Acad. Sci., Budapest (1965), pp. 255?262.
[788] C. Mack and K. Stoodley, ?Machine interference with two repairmen when repair time is constant,? New J. Statist. and Operat. Res., 4, No. 2, 1?7 (1968).
[789] Toji Makino, ?On the mean passage time concerning some queueing problems of the tandem type,? J. Operat. Res. Soc. Japan,7, No. 1, 17?47 (1964).
[790] Toji Makino, ?Investigation of the mean waiting time for queueing system with many servers,? Ann. Inst. Statist. Math.,21, No. 2, 357?366 (1969). · Zbl 0191.50302 · doi:10.1007/BF02532264
[791] N. K. Malhotra, ?Operational readiness of a complex system having two types of components,? Trab. Estadist.,19, No. 3, 117?130 (1968). · Zbl 0177.47303 · doi:10.1007/BF03019449
[792] N. K. Malhotra, ?Stochastic behaviour of a complex system with general waiting- and repair-time distributions,? Trab. Estadist. y Invest. Opera.,20, Nos. 2?3, 161?171 (1969). · Zbl 0187.42101 · doi:10.1007/BF03028528
[793] M. Mandelbaum and B. Avi-Itzhak, ?Introduction to queueing with splitting and matching,? Israel J. Technol.,6, No. 5, 376?382 (1968). · Zbl 0239.60098
[794] G. E. Masterson and S. Sherman, ?On queues in tandem,? Ann. Math. Statist.,34, No. 1, 300?307 (1963). · Zbl 0226.60115 · doi:10.1214/aoms/1177704266
[795] K. Matthes, ?Bedienungsprozesse,? Mathematische und physikalisch-technische Probleme Kibernetik, Berlin (1963), pp. 503?508.
[796] K. Matthes, ?Stationare zufällige Punktfolgen (I),? Jahresber. Deutsch. Math.-Ver.,66, No. 2, 66?79 (1964). · Zbl 0178.52803
[797] K. Matthes, ?Ergodizitätseigenschaften rekurrenter Ereignisse (I),? Math. Nachr.,24, No. 2, 109?119 (1962). · Zbl 0105.11601 · doi:10.1002/mana.19620240204
[798] K. Matthes, ?Zur Theorie der Bedienungsprozesse,? Trans. Third, Prague Conf. Information Theory, Statistical Decision Functions, and Random Processes, 1962, Prague (1964), pp. 513?528.
[799] K. Matthes and K. Nawrotzki, ?Ergodizitäseigenschaften rekurrenter Ereignisse (II),? Math. Nachr.,24, No. 4, 245?253 (1962). · Zbl 0116.10501 · doi:10.1002/mana.19620240404
[800] J. A. McFadden, ?The mixed Poisson process,? Sankhya, Indian J. Statist.,A27, No. 1, 83?92 (1965). · Zbl 0141.15301
[801] M. A. McGregor, ?Approximation formulas for reliability with repair,? IEEE Trans. Reliability,R-12, No. 4, 64?92 (1963). · doi:10.1109/TR.1963.5218229
[802] D. R. McNeil and J. H. T. Morgan, ?Estimating minimum gap acceptances for merging motorists,? Transport. Sci.,2, No. 3, 265?277 (1968). · doi:10.1287/trsc.2.3.265
[803] J. Mecke, ?Ein Grenzwertsatz aus der Zuverlässigkeitstheorie,? Elektron. Informationsverarb. und Kybernet.,2, No. 2, 83?94 (1966). · Zbl 0178.54503
[804] J. Mecke, ?Erneuerungseigenschaften bei Punktprozessen,? Math. Nachr.,30, Nos. 5?6, 275?294 (1965). · Zbl 0202.47201 · doi:10.1002/mana.19650300504
[805] P. Meissl, ?Über ein Wartezeitenproblem an einem Schalter mit regelmässigen Öfmungs- und Sperrzeiten,? Österreich. Ingr.-Arch.,18, Nos. 1?2, 79?93 (1964). · Zbl 0141.16104
[806] D. Mejzler, ?On a characteristic property of stationary streams without aftereffect,? J. Appl. Probab.,2, No. 2, 455?461 (1965). · Zbl 0141.15004 · doi:10.1017/S0021900200108770
[807] D. Mejzler, ?A note on Erlang’s formulas,? Israel J. Math.,3, No. 3, 157?162 (1965). · Zbl 0151.22503 · doi:10.1007/BF02759748
[808] D. Mejzler, ?A generalization of Erlang’s formula in queueing theory,? J. Appl. Probab.,5, No. 1, 143?157 (1968). · Zbl 0159.47105 · doi:10.1017/S0021900200032344
[809] M. J. Melentijevich, ?The analysis of range with output linearly dependent upon storage,? Hydrol. Papers, Colorado State Univ., No. 11 (1965). 29 pages.
[810] A. Mercer, ?A queue with random arrivals and scheduled bulk departures,? J. Roy. Statist. Soc.,B30, No. 1, 185?189 (1968). · Zbl 0155.24602
[811] A. Mercer and J. B. Parker, ?A self-service system with scheduled arrivals,? Queueing Theory, London (1967), pp. 10?19.
[812] C. Michele, ?Risoluzione di un problema di ?doppia coda? mediante equazioni stocastiche integrodifferenziali,? Boll. Centro Ricerca Operat. Metodol.,6, Nos. 1?3, 15?21 (1962).
[813] G. Mihoc and G. Ciucu, Introducere in Teoria Asteptarii, Ed. Tehn., Bucharest (1967), 263 pages.
[814] R. E. Miles, ?A synopsis of Poisson flats in Euclidean spaces,? Izv. Akad. Nauk Arm. SSR, Matematika,5, No. 3, 263?285 (1970). · Zbl 0211.49401
[815] B. L. Miller, ?A queueing reward system with several customer classes,? Management Sci.,16, No. 3, 234?245 (1969). · Zbl 0186.24701 · doi:10.1287/mnsc.16.3.234
[816] R. G. Miller, Jr., ?Continuous-time stochastic storage processes with random linear inputs and outputs,? J. Math. and Mech.,12, No. 2, 275?291 (1963).
[817] Hisashi Mine and Tatsuyuki Asakura, ?The effect of an age replacement to a standby redundant system,? J. Appl. Probab.,6, No. 3, 516?523 (1969). · Zbl 0186.25101 · doi:10.1017/S0021900200026589
[818] N. M. Mirasol, ?The output of an M|G|? queueing system is Poisson,? Operat. Res.,11, No. 2, 282?284 (1963). · Zbl 0114.09401 · doi:10.1287/opre.11.2.282
[819] J. Mogyoródi, ?Rekurrens folyamatok ritkitasarol.? Magyar Tud. Akad. Mat. és Fiz. Tud. Oszt. Közl.,19, Nos. 1?2, 25?31 (1970).
[820] J. Mogyoródi and J. Tomkó, ?Véletlen idöközönkent müködö készúlék élettartamanak haráreloszlásáról,? Magyar Tud. Akad. Mat. Fiz. Tud. Oszt. Közl.,17, No. 4, 421?433 (1967).
[821] S. G. Mohanty and J. S. Jain, ?On two types of queueing processes involving batches,? CORS Journal,8, No. 1, 38?43 (1970). · Zbl 0209.51703
[822] C. E. Montagnon, ?Mean response times in assessing a time-sharing computer,? Operat. Res. Quart.,20, No. 4, 477?487 (1969). · Zbl 0183.45406 · doi:10.1057/jors.1969.105
[823] P. A. P. Moran, ?Dams in series with continuous release,? J. Appl. Probab.,4, No. 2, 380?388 (1967). · Zbl 0173.21702 · doi:10.1017/S0021900200032125
[824] P. A. P. Moran, ?A theory of dams with continuous input and a general release rule,? J. Appl. Probab.,6, No. 1, 88?98 (1969). · Zbl 0181.46702 · doi:10.1017/S0021900200032551
[825] D. Morgenstern, ?Eine diskrete Verteilung für ein Warteschlangenproblem,? Metrika,11, No. 2, 81?84 (1966). · Zbl 0203.19002 · doi:10.1007/BF02613577
[826] E. Morice and P. Thionet, ?Loi binomiale et loi de Poisson,? Rev. Statist. Appl.,17, No. 3, 75?89 (1969).
[827] R. Morton, ?Expected overflow of a dam,? Nature,212, No. 5059, 326 (1966). · doi:10.1038/212326b0
[828] J. L. Mott, ?The distribution of the time-to-emptiness of a discrete dam under steady demand,? J. Roy. Statist. Soc.,B25, No. 1, 137?139 (1963). · Zbl 0114.34302
[829] K. Murari, ?A queueing problem with correlated arrivals and general service-time distribution,? Z. Angew. Math. and Mech.,49, No. 3, 151?156 (1969). · Zbl 0175.16802 · doi:10.1002/zamm.19690490304
[830] K. Murari, ?A queueing problem with arrivals in batches of variable size and service rate depending on queue length,? Z. Angew. Math. and Mech.,49, No. 3, 157?162 (1969). · Zbl 0175.16803 · doi:10.1002/zamm.19690490305
[831] G. Nagy, ?The reliability of repairable systems,? Proc. Ninth Nat. Sympos. Reliability and Quality Control, San Francisco, 1963, Inst. Radio Engrs., New York (1963), pp. 93?108.
[832] T. Narasimham, ?A note on the asymptotic distribution of the traffic time-average in a GI|bG|? with bulk arrivals,? J. Appl. Probab.,5, No. 2, 476?480 (1968). · Zbl 0196.20301
[833] R. Natarajan, ?Long-run availability of parallel systems,? Metrika,13, Nos. 2?3, 104?122 (1968). · Zbl 0162.22401 · doi:10.1007/BF02613379
[834] R. T. Nelson, ?Queueing network experiments with varying arrival and service processes,? Nav. Res. Log. Quart.,13, No. 3, 321?347 (1966). · doi:10.1002/nav.3800130308
[835] R. T. Nelson, ?A decision-making model for applications of queueing theory,? AIIE Trans.,2, No. 2, 112?117 (1970). · doi:10.1080/05695557008974739
[836] M. F. Neuts, ?An inventory model with an optimal time lag,? J. Soc. Indust. and Appl. Math.,12, No. 1, 179?185 (1964). · Zbl 0128.14601 · doi:10.1137/0112016
[837] M. F. Neuts, ?The distribution of the maximum length of a Poisson queue during a busy period,? Operat. Res.,12, No. 2, 281?285 (1964). · Zbl 0127.35101 · doi:10.1287/opre.12.2.281
[838] M. F. Neuts, ?The busy period of a queue with batch service,? Operat. Res.,13, No. 5, 815?819 (1965). · Zbl 0133.11303 · doi:10.1287/opre.13.5.815
[839] M. F. Neuts, ?Semi-Markov analysis of a bulk queue,? Bull. Soc. Math. Belgique,18, No. 1, 28?42 (1966). · Zbl 0141.15901
[840] M. F. Neuts, ?The single-server queue with Poisson input and semi-Markov service times,? J. Appl. Probab.,3, No. 1, 202?230 (1966). · Zbl 0204.20003 · doi:10.1017/S0021900200114056
[841] M. F. Neuts, ?Two Markov chains arising from examples of queues with state-dependent service times,? Sankhya, Indian J. Statist.,29, No. 3, 259?264 (1967). · Zbl 0155.24505
[842] M. F. Neuts, ?The joint distribution of the virtual waiting time and the residual busy period for the M|G|1 queue,? J. Appl. Probab.,5, No. 1, 224?229 (1968). · Zbl 0164.48102 · doi:10.1017/S0021900200032435
[843] M. F. Neuts, ?Two queues in series with a finite, intermediate waiting room,? J. Appl. Probab.,5, No. 1, 123?142 (1968). · Zbl 0157.25402 · doi:10.1017/S0021900200032332
[844] M. F. Neuts, ?The queue with Poisson input and general service times, treated as a branching process,? Duke Math. J.,36, No. 2, 215?231 (1969). · Zbl 0183.49401 · doi:10.1215/S0012-7094-69-03628-X
[845] M. F. Neuts and J. L. Teugels, ?Exponential ergodicity of the M|G|1 queue,? SIAM J. Appl. Math.,17, No. 5, 921?929 (1969). · Zbl 0183.49303 · doi:10.1137/0117081
[846] M. F. Neuts and M. Yadin, ?The transient behavior of the queue with alternating priorities, with special reference to the waiting times,? Bull. Soc. Math. Belgique,20, No. 4, 343?376 (1968). · Zbl 0181.46704
[847] J. Neveu, ?Sur la structure des processus ponctuels stationnaires,? Compt. Rend.,267, No. 16, A561-A564 (1968). · Zbl 0164.19102
[848] G. F. Newell, ?Approximation methods for queues with application to the fixed-cycle traffic light,? SIAM Rev.,7, No. 2, 223?240 (1965). · Zbl 0142.17802 · doi:10.1137/1007038
[849] G. F. Newell, ?The M|G|? queue,? J. Soc. Indust. and Appl. Math., 14, No. 1, 86?88 (1966). · doi:10.1137/0114007
[850] G. F. Newell, ?Equilibrium probability distributions for low-density highway traffic,? J. Appl. Probab.,3, No. 1, 247?260 (1966). · Zbl 0139.13608 · doi:10.1017/S002190020011407X
[851] G. F. Newell, ?Queues with time-dependent arrival rates, II: The maximum queue and the return to equilibrium,? J. Appl. Probab.,5, No. 3, 579?590 (1968). · Zbl 0185.46305
[852] G. F. Newell, ?Queues with time-dependent arrival rates, III: A mild rush hour,? J. Appl. Probab.,5, No. 3, 591?606 (1968). · Zbl 0188.49204
[853] D. S. Newman, ?A new family of point processes which are characterized by their second moment properties,? J. Appl. Probab.,7, No. 2, 338?358 (1970). · Zbl 0284.60052 · doi:10.1017/S0021900200034926
[854] J. Neyman, ?On finiteness of the process of clustering,? Sankhya, Indian J. Statist.,A25, No. 1, 69?74 (1963). · Zbl 0129.30301
[855] Toshio Nishida, ?On the multiple exponential channel queueing system with hyper-Poisson arrivals,? J. Operat. Res. Soc. Japan,5, No. 2, 57?66 (1962).
[856] Toshio Nishida and Hiromu Watada, ?Tandem queue with Erlangian inputs and finite waiting room,? Technol. Repts. Osaka Univ.,19, 285?299 (1969).
[857] S. Nordio, ?Alcune considerazioni sulla formula dell’Eriang,? Tecn. Ital.,30, No. 11, 721?723 (1965).
[858] R. M. Oliver, ?An alternate derivation of the Pollaczek-Khintchine formula,? Operat. Res.,12, No. 1, 158?159 (1964). · Zbl 0122.36606 · doi:10.1287/opre.12.1.158
[859] R. M. Oliver, ?Table of the waiting-time distribution for the constant service queue (M|D|1),? Internat. J. Comput. Math.,2, No. 1, 35?56 (1968). · Zbl 0164.48202 · doi:10.1080/00207166808803024
[860] Shunji Osaki, ?Reliability analysis of a two-unit standby redundant system with priority,? CORS Journal,8, No. 1, 60?62 (1970). · Zbl 0195.21405
[861] Shunji Osaki and Tatsuyuki Asakura, ?A two-unit standby redundant system with repair and preventive maintenance,? J. Appl. Probab.,7, No. 3, 641?648 (1970). · Zbl 0205.22901 · doi:10.1017/S0021900200110605
[862] J. Otterman, ?Probability distribution of delays for store-and-forward traffic mixed with direct traffic,? IEEE Trans. Communications System,CS-11, No. 1, 41?48 (1963). · doi:10.1109/TCOM.1963.1088733
[863] E. Paananen, ?Two queues in tandem,? BIT (Sweden),8, No. 1, 48?52 (1968). · Zbl 0164.48101
[864] E. S. Page, ?On Monte Carlo methods in congestion problems, II: Simulation of queueing systems,? Operat. Res.,13, No. 2, 300?305 (1965). · Zbl 0127.10005 · doi:10.1287/opre.13.2.300
[865] A. G. Pakes, ?A note on the queueing systems GI|D|1 and D|G|1,? J. Appl. Probab.,7, No. 2, 465?468 (1970). · doi:10.1017/S0021900200035063
[866] P. Passau, ?Files d’attente et processus markoviens a une intersection de trafic; comparaison de divers modes de controle,? Queueing Theory, London (1967), pp. 185?192.
[867] R. L. Patterson, ?Markov processes occurring in the theory of traffic flow through an N-stage stochastic service system,? J. Indust. Engng.,15, No. 4, 188?193 (1964).
[868] C. Pearce, ?A queueing system with moving average input process and batch arrivals,? J. Austral. Math. Soc.,5, No. 4, 434?442 (1965). · Zbl 0203.18503 · doi:10.1017/S1446788700028469
[869] C. Pearce, ?A queueing system with nonrecurrent input and batch servicing,? J. Appl. Probab.,2, No. 2, 442?448 (1965). · Zbl 0218.60091 · doi:10.1017/S0021900200108757
[870] C. Pearce, ?A queueing system with general moving average input and negative exponential service time,? J. Austral. Math. Soc.,6, No. 2, 223?236 (1966). · Zbl 0147.16703 · doi:10.1017/S1446788700004808
[871] C. Pearce, ?Queues with moving average service times,? J. Appl. Probab.,4, No. 3, 553?570 (1967). · Zbl 0178.20901 · doi:10.1017/S0021900200025547
[872] C. Pearce, ?On the tandem queueing system GI|M|1-...|M|1 with restricted waiting room in the first stage,? Sankhya, Indian J. Statist.,A30, No. 1, 75?82 (1968). · Zbl 0239.60088
[873] C. Pearce, ?Queueing systems with transport service processes,? Transport. Sci.,1, No. 3, 218?223 (1967). · doi:10.1287/trsc.1.3.218
[874] C. Pearce, ?On the joint equilibrium queue-length distribution in a series queue,? CORS Journal,6, No. 2, 96?100 (1968). · Zbl 0159.47104
[875] C. Pearce, ?On a many-server queue with nonrecurrent input and negative exponential servers,? J. Austral. Math. Soc.,8, No. 4, 706?715 (1968). · Zbl 0177.46101 · doi:10.1017/S1446788700006522
[876] E. Pesonen, ?On definition of compound Poisson processes,? Skand. Aktuarietidskr., Nos. 3?4, 156?157 (1968).
[877] G. Pestalozzi, ?A queue with Markov-dependent service times,? J. Appl. Probab.,5, No. 2, 461?466 (1968). · Zbl 0177.46002 · doi:10.1017/S0021900200110137
[878] P. E. Peters, ?Delays for a LIFO queue with constant service time,? Operat. Res.,16, No. 6, 1147?1151 (1968). · Zbl 0165.52802 · doi:10.1287/opre.16.6.1147
[879] R. M. Phatarfod, ?Application of methods in sequential analysis to dam theory,? Ann. Math. Statist.,34, 1588?1592 (1963). · Zbl 0124.36004 · doi:10.1214/aoms/1177703892
[880] R. M. Phatarfod, ?A note on the first emptiness problem of a finite dam with Poisson-type inputs,? J. Appl. Probab.,6, No. 1, 227?230 (1969). · doi:10.1017/S0021900200032691
[881] D. T. Phillips and R. W. Skeith, ?Ordered-entry queueing networks with multiple servers and multiple queues,? AIIE Trans.,1 No. 4, 333?342 (1969). · doi:10.1080/05695556908974717
[882] W. H. Pierce, ?Asymptotic properties of systems synthesized for maximum reliability,? Information and Control,7, No. 3, 340?359 (1964). · Zbl 0227.90022 · doi:10.1016/S0019-9958(64)90390-0
[883] W. P. Pierskalla, ?An inventory problem with obsolescence,? Nav. Res. Log. Quart.,16, No. 2, 217?228 (1969). · Zbl 0175.17603 · doi:10.1002/nav.3800160206
[884] M. C. Pike, ?Some numerical results for the queueing system D|Ek|1,? J. Roy. Statist. Soc.,B25, No. 2, 477?488 (1963). · Zbl 0129.31001
[885] J. Pontier, ?Systémes á services par essais successifs,? Compt. Rend.,266, No. 18, A933-A936 (1968). · Zbl 0157.49304
[886] J. Pontier, ?Systémes á services par essais successifs: systémes á mémoire,? Compt. Rend.,266, No. 19, A991-A993 (1968). · Zbl 0239.60101
[887] S. C. Port, Some Limit Theorems Associated with A Recurrent Event, Rand Corp. Mem. No. RM-3491-PR (Clearinghouse Fed. Sci. Techn. Inform., No. AD-400141), Santa Monica, Calif. (1963), 66 pages.
[888] M. Posner and B. Bernholtz, ?Two-stage closed queueing systems with time lags,? CORS Journal,5, No. 2, 82?99 (1967). · Zbl 0178.21303
[889] M. Posner and B. Bernholtz, ?Closed finite queueing networks with time lags,? Operat. Res.,16, No. 5, 962?976 (1968). · Zbl 0177.45902 · doi:10.1287/opre.16.5.962
[890] M. Posner and B. Bernholtz, ?Closed finite queueing networks wim time lags and with several classes of units,? Operat. Res.,16, No. 5, 977?985 (1968). · Zbl 0177.46001 · doi:10.1287/opre.16.5.977
[891] N. U. Prabhu, ?A waiting-time process in the queue GI|M|1,? Acta Math. Acad. Sci. Hung.,15, Nos. 3?4, 363?371 (1964). · Zbl 0131.17001 · doi:10.1007/BF01897144
[892] N. U. Prabhu, ?Time-dependent results in storage theory,? J. Appl. Probab.,1, No. 1, 1?46 (1964). · Zbl 0131.16903 · doi:10.1017/S0021900200111532
[893] N. U. Prabhu, Queues and Inventories; A Study of Their Basic Stochastic Processes, Wiley, New York-London-Sydney (1965). 275 pages. · Zbl 0131.16904
[894] N. U. Prabhu, ?Some new results in storage theory,? J. App. Probab.,5, No. 2, 452?460 (1968). · Zbl 0186.24802 · doi:10.1017/S0021900200110125
[895] N. U. Prabhu, ?Limit theorems for the single-server queue with traffic intensity one,? J. Appl. Probab.,7, No. 1, 227?233 (1970). · Zbl 0191.50301 · doi:10.1017/S0021900200027078
[896] N. U. Prabhu, ?The queue GI|M|1 with traffic intensity one,? Studia Sci. Math. Hung.,5, Nos. 1?2, 89?96 (1970). · Zbl 0208.22503
[897] N. U. Prabhu and U. Narayan Bhat, ?Further results for the queue with Poisson arrivals,? Operat. Res.,11, No. 3, 380?386 (1963). · Zbl 0123.35701 · doi:10.1287/opre.11.3.380
[898] A. Predetti, Contributi all’Analisi Statistica di piu Caratteri, A. Giuffré, Milan (1963). 142 pages; Bibliogr. Naz. Ital,6, No. 6, 370 (1963).
[899] A. Prékopa, ?Reliability equation for an inventory problem and its asymptotic solutions,? Colloq. Applications of Mathematics to Economics, Budapest, 1963, Hung. Acad. Sci., Budapest (1965), pp. 317?327.
[900] H.-J. Presia, ?Über eine Verallgemeinerung der Erlangschen Formeln. Wiss. Z. Tech. Hochschule Ilmenau,13, No. 4, Part 2, 435?450 (1967). · Zbl 0233.60079
[901] R. K. Rana, ?On a certain type of bulk queueing problem with general service-time distribution,? Z. Angew. Math. und Mech.,48, No. 7, 495?497 (1968). · Zbl 0232.60091 · doi:10.1002/zamm.19680480714
[902] F. P. Randazzo, ?Optimization of network configurations through queueing theory,? Electr. Commun.,38, No. 4, 511?523 (1963).
[903] R. Rangarajan and R. M. Oliver, ?Allocations of servicing periods that minimize average delay for N time-shared traffic streams,? Trasport. Sci.,1, No. 2, 74?80 (1967). · doi:10.1287/trsc.1.2.74
[904] J. Sudarsana Rao, ?An application of stationary point processes to queueing theory and textile research,? J. Appl. Probab.,3, No. 1, 231?246 (1966). · Zbl 0178.52802 · doi:10.1017/S0021900200114068
[905] M. Rao and H. Wedel, ?Poisson processes as renewal processes invariant under translations,? Arkiv Mit.,7, No. 6, 539?541 (1969). · Zbl 0214.44002 · doi:10.1007/BF02590892
[906] S. Subba Rao, ?Queueing models with balking, reneging, and interruptions,? Operat. Res.,13, No. 4, 596?608 (1965). · Zbl 0253.60082 · doi:10.1287/opre.13.4.596
[907] S. Subba Rao, ?The effect of postponable interruptions on a M|G|1 system with impatient customers,? Austral. J. Statist.,9, No. 1, 16?34 (1967). · Zbl 0171.16205 · doi:10.1111/j.1467-842X.1967.tb00174.x
[908] S. Subba Rao, ?Queueing models with balking and reneging,? Ann. Inst. Statist. Math.,19, No. 1, 55?71 (1967). · Zbl 0153.20202 · doi:10.1007/BF02911668
[909] S. Subba Rao, ?Queueing with balking and reneging in M|G|1 systems,? Metrika,12, Nos. 2?3, 173?188 (1968).
[910] S. Subba Rao, ?Balking and reneging in M|G|1 systems with postponable interruptions,? Metrika,14, No. 1, 101?116 (1968). · Zbl 0167.17203 · doi:10.1007/BF02613645
[911] S. Subba Rao and N. K. Jaiswal, ?On a class of queueing problems and discrete transforms,? Operat. Res.,17, No. 6, 1062?1076 (1969). · Zbl 0183.49302 · doi:10.1287/opre.17.6.1062
[912] P. J. Rasch, ?A queueing-theory study of round-robin scheduling of time-shared computer systems,? J. Assoc. Comput. Mach.,17, No. 1, 131?145 (1970). · Zbl 0197.15401 · doi:10.1145/321556.321569
[913] R. R. Read, ?On the output of parallel exponential service channels,? Nav. Res. Log. Quart.,16, No. 4, 555?572 (1969). · Zbl 0197.45906 · doi:10.1002/nav.3800160411
[914] E. Reich, ?Note on queues in tandem,? Ann. Math. Statist.,34, No. 1, 338?341 (1963). · Zbl 0114.09202 · doi:10.1214/aoms/1177704275
[915] A. Rényi, ?On the dimension and entropy of probability distributions,? Acta Math., Acad. Sci. Hung.,10, Nos. 1?2, 193?215 (1959). · Zbl 0088.10702 · doi:10.1007/BF02063299
[916] A. Rényi, ?On an extremal property of the Poisson process,? Ann. Inst. Statist. Math.,16, Nos. 1?2, 129?133 (1964). · Zbl 0126.33404 · doi:10.1007/BF02868567
[917] A. Rényi, ?On two mathematical models of the traffic on a divided highway,? J. Appl. Probab.,1, No. 2, 311?320 (1964). · Zbl 0279.90016 · doi:10.1017/S0021900200108423
[918] A. Rényi, ?On stable sequences of events,? Sankhya, Indian J. Statist.,A25, No. 3, 293?302 (1963).
[919] A. Rényi, ?Remarks on the Poisson process,? Studia Sci. Math. Hung.,2, Nos. 1?2, 119?123 (1967).
[920] A. Rényi, ?Remarks on the Poisson process,? Lect. Notes Math.,31, 280?286 (1967). · Zbl 0149.12905 · doi:10.1007/BFb0061124
[921] M. Resh and P. Naor, ?An inventory problem with discrete time review and replenishment bybatches of fixed size,? Management Sci.,10, No. 1, 109?118 (1963). · Zbl 0143.42904 · doi:10.1287/mnsc.10.1.109
[922] M. Resh and P. Naor, ?An inventory problem with discrete time review and replenishment by batches of fixed size,? Colloq. Applications of Mathematics to Economics, Budapest, 1963, Hung. Acad. Sci., Budapest (1965), pp. 329?337.
[923] J. F. Reynolds, ?On the autocorrelation and spectral functions of queues,? J. Appl. Probab.,5, No. 2, 467?475 (1968). · Zbl 0185.46303 · doi:10.1017/S0021900200110149
[924] S. O. Rice, ?Single-service systems, II: Busy periods,? Bell System Techn. J.,41, No. 1, 279?310 (1962). · doi:10.1002/j.1538-7305.1962.tb03269.x
[925] B. Rider, ?Queueing theory ? a new management tool,? Western UnionTechn. Rev.,23, No. 4, 150?158 (1969).
[926] R. Rishel, ?A stochastic treatment of a control system with breakdown and repair,? Information and Control,5, No. 2, 144?152 (1962). · Zbl 0105.32906 · doi:10.1016/S0019-9958(62)90280-2
[927] P. Robillard and P. Naor, ?On queueing with regular service interruptions,? Rev. Franç. Inform, et Rech. Opérat.,2, No. 10, 11?29 (1968).
[928] M. Rosenberg, ?The machine repair problem with ancillary work,? Proc. Third Internat. Conf. Operations Research, Oslo, 1963, Paris-London (1964), pp. 861?863.
[929] S. M. A. Ross, ?Markovian replacement model with a generalization to include stocking,? Management Sci.,15, No. 11, 702?727 (1969). · Zbl 0206.22301 · doi:10.1287/mnsc.15.11.702
[930] S. M. A. Ross, ?Identifiability in GI|G|k queues,? J. Appl. Probab.,7, No. 3, 776?780 (1970). · Zbl 0205.23005 · doi:10.1017/S0021900200110733
[931] H.-J. Rossberg, ?Eine neue Methode zur Behandlung der Integralgleichung von Lindley und ihrer Verallgemeinerung durch Finch,? Elektron. Informationsverarb. und Kybernet.,3, No. 4, 215?238 (1967). · Zbl 0153.20102
[932] H.-J. Rossberg, ?Optimale Eigenschaften einiger Wartesysteme bei regelmassigem Eingang bzw. konstanten Bedienungszeiten,? Z. Angew. Math. und Mech.,48, No. 6, 395?403 (1968). · Zbl 0237.60040 · doi:10.1002/zamm.19680480605
[933] H.-J. Rossberg, ?Bemerkungen zu einer Arbeit von K. T. Marshall über das Wartemodell G|G|1,? Z. Angew. Math. und Mech.,50, Nos. 6?7, 423 (1970). · Zbl 0211.48703 · doi:10.1002/zamm.19700500614
[934] M. Roubens, ?Influence de l’arret d’un vehicule sur le flot en amont,? Rev. Belge Statist, et Rech. Opérat.,9, No. 4, 19?28 (1969).
[935] J. T. Runnenburg, ?On J. F. C. Kingman’s conjecture about waiting-time distributions,? Nieuw. Arch. Wiskunde,18, No. 1, 16?35 (1970).
[936] J. I. Rzytka, ?Recurrent events in queues with independent arrival intervals,? Zastosow. Mat.,8, No. 1, 47?56 (1965). · Zbl 0156.18601
[937] R. A. Sack, ?Treatment of the nonequilibrium theory of simple queues by means of cumulative probabilities,? J. Roy Statist. Soc.,B25, No. 2, 457?463 (1963).
[938] G. Sankaranarayanan and C. Suyambulingom, ?Some renewal theorems concerning a sequence of correlated random variables,? Pacific J. Math.,30, No. 3, 785?803 (1969). · Zbl 0169.49003 · doi:10.2140/pjm.1969.30.785
[939] K. Sarkadi, ?An extension of Chebyshev’s inequality,? Zastosow. Mat.,10, 143?153 (1969). · Zbl 0229.60014
[940] P. V. S. Sarma, ?Behaviour of the queueing system with general input and random service time with a single server,? Current Sci.,33, No. 20, 612 (1964).
[941] R. Schassberger, ?Ein Wartesystem mit zwei parallelen Warteschlangen,? Computing,3, No. 2, 110?124 (1968). · Zbl 0185.46001 · doi:10.1007/BF02277453
[942] R. Schassberger, Ein Wartesystem mit zwei parallelen Schlangen (Doctoral Dissertation), Techn. Hochschule Stuttgart (1967), 38 pages.
[943] R. Schassberger, ?A service system with two parallel queues,? Computing,4, No. 1, 24?29 (1969). · Zbl 0209.19803 · doi:10.1007/BF02236539
[944] G. Schay, Jr., ?Approximate methods for a multiqueueing problem,? IBM J. Res. and Develop.,6, No. 2, 246?249 (1962). · Zbl 0124.34304 · doi:10.1147/rd.62.0246
[945] W. Schneeweiss, ?Umrechnungsformeln zur Theorie der stationären Punktprozesse,? Arch., Elektr. Übertrag.,22, No. 12, 600?604 (1968).
[946] W. Schneeweiss, ?Nachtrag zu Umrechnungsformeln zur Theorie der stationären Punktprozesse,? Arch. EIektr. Übertrag.,23, No. 5, 271?272 (1969).
[947] L. E. Schrage, ?The queue M|G|l with feedback to lower priority queues,? Management Sci.,13, No. 7, 466?474 (1967). · doi:10.1287/mnsc.13.7.466
[948] L. E. Schrage, ?Analysis and optimization of a queueing model of a real-time computer control system,? IEEE Trans. Computers,C-18, No. 11, 997?1003 (1969). · Zbl 0184.20601 · doi:10.1109/T-C.1969.222569
[949] M. Schwob and G. Peyrache, Traité de Fiabilité, Masson et Cie., Paris (1969). 426 pages.
[950] M. Scott, ?On the number of tasks by a machine subject to breakdown,? Cahiers Centre Études Rech. Opérat.,9, No. 1, 44?56 (1967).
[951] M. Scott, A. Study of Some Single-Counter Queueing Processes (Doctoral Dissertation), Univ. North Carolina, Chapel Hill (1964), 131 pages; Dissert. Abstr.,25, No. 11, 6665 (1965).
[952] M. Scott, ?A queueing process with some discrimination,? Management Sci.,16, No. 3, 227?233 (1969). · Zbl 0184.44801 · doi:10.1287/mnsc.16.3.227
[953] R. J. Serfling, ?Non-Poisson models for traffic flow,? Transport. Res.,3, No. 3, 299?306, (1969). · doi:10.1016/S0041-1647(69)80015-8
[954] D. N. Shanbhag, ?On queues with Poisson service time,? Austral. J. Statist.,5, No. 2, 57?61 (1963). · doi:10.1111/j.1467-842X.1963.tb00141.x
[955] D. N. Shanbhag, ?On the asymptotic behaviour of a single-server queue,? Austral. J. Statist.,7, No. 2, 48?53 (1963). · Zbl 0143.20402 · doi:10.1111/j.1467-842X.1965.tb00152.x
[956] D. N. Shanbhag, ?A note on queueing systems with Erlangian service-time distributions,? Ann. Math. Statist.,36, No. 5, 1574?1578 (1965). · Zbl 0138.41003 · doi:10.1214/aoms/1177699919
[957] D. N. Shanbhag, ?Further results for the queueing system GI|M|1,? J. Karnatak Univ. Soc.,64, No. 2, 477?479 (1968).
[958] D. N. Shanbhag, ?On a duality principle in the theory of queues,? Operat. Res.,14, No. 5, 947?949 (1966). · Zbl 0158.16901 · doi:10.1287/opre.14.5.947
[959] D. N. Shanbhag, ?On congestion systems with negative exponential desired service-time distributions,? Ann. Inst. Statist. Math.,18, No. 2, 223?228 (1966). · Zbl 0149.13802 · doi:10.1007/BF02869532
[960] D. N. Shanbhag, ?On infinite server queues with batch arrivals,? J. Appl. Probab.,3, No. 1, 274?279 (1966). · Zbl 0158.36104 · doi:10.1017/S0021900200114111
[961] D. N. Shanbhag, ?A note on the queueing system GI|G|?,? Proc. Cambridge Phil. Soc.,64, No. 2, 477?479 (1968). · Zbl 0164.47801 · doi:10.1017/S0305004100043085
[962] D. N. Shanbhag, ?A queueing system with several types of customers,? Ann. Inst. Statist. Math.,21, No. 2, 367?371 (1969). · Zbl 0194.20702 · doi:10.1007/BF02532265
[963] Sharda, ?A queueing problem with intermittently available server and arrivals and departures in batches of variable size,? Z. Angew. Math und Mech.,48, No. 7, 471?475 (1968). · Zbl 0205.48403 · doi:10.1002/zamm.19680480707
[964] Sharda, ?A many-server queueing problem with variable departures,? Z. Angew. Math. und Mech.,49, No. 3, 163?166 (1969). · Zbl 0175.16804 · doi:10.1002/zamm.19690490306
[965] C. Siegel, ?Results on a transient queue,? Commun. Pure and Appl. Math.,21, No. 4, 371?384 (1968). · Zbl 0167.17204 · doi:10.1002/cpa.3160210406
[966] C. Siegel, ?On a moving server with bounded range,? Commun. Pure and Appl. Math.,21, No. 4, 359?370 (1968). · Zbl 0177.21903 · doi:10.1002/cpa.3160210405
[967] P. Vijendra Singh, ?Output of M|M|1|N queue,? J. Operat. Res. Soc. Japan,11, No. 4, 146?148 (1969).
[968] P. Vijendra Singh, ?Two-server Markovian queues with balking; heterogeneous vs. homogeneous servers,? Operat. Res.,18, No. 1, 145?159 (1970). · Zbl 0186.24703 · doi:10.1287/opre.18.1.145
[969] A. Sniatycki, ?Pewien problem stopy uslug, gdy kosztuje czas oczekiwania,? Zesz. Nauk. Wyzsza Szkola Ped. Gda?sku. Mat. Fiz.,Chem.,7, 21?24 (1967).
[970] R. L. Snyder, ?A partial spectrum approach to the analysis of quasi-stationary time series,? IEEE Trans. Information Theory,IT-13, No. 4, 579?587 (1967). · Zbl 0173.20801 · doi:10.1109/TIT.1967.1054051
[971] A. D. Soloviev, ?Theory of aging elements,? Proc. Fiftieth Berkeley Sympos. Mathematical Statistics and Probability, 1965?66, Vol. 3, Berkeley-Los Angeles (1967), pp. 313?324.
[972] S. K. Srinivasan and K. S. Iyer, ?Random processes associated with random points on a line,? Zastosow. Mat.,18, No. 3, 221?230 (1966). · Zbl 0138.16804
[973] S. K. Srinivasan and G. Rajamannar, ?Selective interaction between two independent stationary recurrent point processes,? J. Appl. Probab.,7, No. 2, 476?482 (1970). · Zbl 0239.60081 · doi:10.1017/S0021900200035099
[974] S. S. Srivastava, R. C. Garg, Santosh Kumar, and Surya Prakash, ?Stochastic behaviour of a standby redundant complex system,? Cahiers Centre Études Rech. Opérat.,12, No. 4, 233?243 (1970).
[975] F. Stadler, ?Teorie from v postovnim provozu,? Práce Vyzkumn. Ústavu Spoju, No. 5, 36?49 (1965).
[976] F. Stadler, ?Nékolik poznâmek k teorii spojovacich svazku,? Slaboproudy Obxor,23, No. 12, 698?705 (1962).
[977] K. Stange, ?Zwei in Reihe angeordnete Schalter (mit einer Warteschlange dazwischen) bei Exponentialverteilung der Ankünfte und Abgánge,? Unternehmensforschung,6, No. 3, 101?124 (1962). · Zbl 0113.33904
[978] K. Stange, ?Die Anlauflösung fur den einfachen exponentiellen Bedienungskanal (mit beliebig vielen Warteplätzen) der für t=0 leer ist,? Unternehmensforschung,8, No. 1, 1?24 (1964). · Zbl 0113.34001
[979] L. H. Stember, Jr., and W. Adelmen, ?Estimating IC reliability ? a suggested mathematical model,? Microelectronics,1, No. 1, 22?25 (1967).
[980] J. H. Stephenson, Investigation of Reliability Characteristics of Some Complex Networks (Master of Science Thesis), Fac. School Engng. Air Force Inst. Technol. Air Univ. (Clearinghouse Fed. Sci. Tech. Inform., NAD-419114) (1963). 49 pages.
[981] S. Stidham, Jr., ?On the optimality of single-server queueing systems,? Operat. Res.,18, No. 4, 708?732 (1970). · Zbl 0247.60060 · doi:10.1287/opre.18.4.708
[982] H. Störmer, ?Über Wartezeiten im Strassenverkehr,? Z. Angew. Math. und Mech., 43, Suppl., 48?50 (1963). · doi:10.1002/zamm.19630430118
[983] H. Störmer, ?Zur Überlagerung von Erneuerungsprozessen,? Z. Wahrscheinlichkeitstheor. und Verw. Geb.,13, No. 1, 9?24 (1969). · Zbl 0177.21403 · doi:10.1007/BF00535794
[984] H. Stoyan and D. Stoyan, ?Monotonieeigenschaften der Kundenwartezeiten im Modell GI|G|1,? Z. Angew. Math. und Mech.,49, No. 12, 729?734 (1969). · Zbl 0191.50201 · doi:10.1002/zamm.19690491205
[985] S. Sugawara and M. Takahashi, ?On some queues occurring in an integrated iron and steel works,? J. Operat. Res. Soc. Japan,8, No. 1, 16?23 (1965). · Zbl 0134.14401
[986] M. W. Suh, B. B. Bhattacharya, and A. Grandage, ?On the distribution and moments of the strength of a bundle of filaments,? J. Appl. Probab.,7, No. 3, 712?720 (1970). · Zbl 0205.43502 · doi:10.1017/S0021900200110654
[987] Takeji Suzuki, ?Two queues in series,? J. Operat. Res. Soc. Japan,5, No. 4, 149?155 (1963).
[988] Takeji Suzuki, ?Batch-arrival queueing problem,? J. Operat. Res. Soc. Japan,5, No. 4, 137?148 (1963).
[989] Takeji Suzuki, ?Ergodicity of a tandem queue with blocking,? J. Operat. Res. Soc. Japan,7, No. 2, 68?75 (1964).
[990] Takeji Suzuki, ?Counter problems and Spitzer’s identity,? Mem. Def. Acad.,7, No. 2a, 531?543 (1967). · Zbl 0178.21002
[991] Takeji Suzuki and Masao Ebe, ?Limit theorems for a queueing process and their applications,? J. Operat. Res. Soc. Japan,11, No. 1, 32?51 (1968). · Zbl 0179.48001
[992] Takeji Suzuki and Iwashita Shinzo, ?On the type I and type IV counter problems,? Mem. Def. Acad.,7, No. 4, 1605?1626 (1967). · Zbl 0252.60056
[993] J. S. Sykes, ?Analytical model of half-duplex interconnections of computers,? IEEE Trans. Communication Technology,CT-17, No. 2, 235?238 (1969). · doi:10.1109/TCOM.1969.1090075
[994] J. S. Sykes, ?Simplified analysis of an alternating-priority queueing model with setup times,? Operat. Res.,18, No. 6, 1182?1192 (1970). · Zbl 0215.54001 · doi:10.1287/opre.18.6.1182
[995] Second Symposium on the Theory of Traffic Flow, London, June 25?27, 1963; Summary of Communications, Org. Econ. Cooperat. and Develop. (1965), 63 pages.
[996] A. Taha Hamdy, ?A case study comparison of independent channels versus a combined pool,? J. Indust. Engng.,19, No. 3, 137?142 (1968).
[997] M. Tainiter, ?On stochastic counting processes associated with a semi-Markov process,? J. Soc. Indust. and Appl. Math.,12, No. 4, 734?744 (1964). · Zbl 0134.15505 · doi:10.1137/0112061
[998] L. Takács, ?The stochastic law of the busy period for a single-server queue with Poisson input,? J. Math. Anal. and Applic.,6, No. 1, 33?42 (1963). · Zbl 0117.36004 · doi:10.1016/0022-247X(63)90089-1
[999] L. Takács, ?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, Indian J. Statist.,A25, No. 1, 91?100 (1963).
[1000] L. Takács, ?The distribution of the virtual waiting time for a single-server queue with Poisson input and general service times,? Operat. Res.,11, No. 2, 261?264 (1963). · Zbl 0109.36801 · doi:10.1287/opre.11.2.261
[1001] L. Takács, ?Combinatorial methods in the theory of queues,? Rev. Inst. Internat. Statist.,32, No. 3, 207?219 (1964). · Zbl 0125.36904 · doi:10.2307/1401866
[1002] L. Takács, ?Occupation-time problems in the theory of queues,? Operat. Res.,12, No. 5, 753?767 (1964). · Zbl 0129.30805 · doi:10.1287/opre.12.5.753
[1003] L. Takács, ?The distribution of the content of finite dams,? J. Appl. Probab.,4, No. 1, 151?161 (1967). · doi:10.1017/S0021900200025316
[1004] L. Takács, ?On dams of finite capacity,? J. Austral. Math. Soc.,8, No. 2, 161?170 (1968). · Zbl 0162.23401 · doi:10.1017/S144678870000519X
[1005] L. Takács, Combinatorial Methods in the Theory of Stochastic Processes, Wiley, New York (1967), 262 pages.
[1006] L. Takács, ?On inverse queueing processes,? Zastosow. Mat.,10, 213?224 (1969).
[1007] L. Takács, ?On the classical ruin problems,? J. Amer. Statist. Assoc.,64, No. 327, 889?906 (1969).
[1008] Shunro Takamatsu, ?On the come-and-stay interarrival time in a modified queueing system, M|G|1,? Ann. Inst. Statist. Math.,15, No. 1, 73?78 (1963). · Zbl 0129.30904 · doi:10.1007/BF02865905
[1009] Shunro Takamatsu, ?On the come-and-stay interarrival time in a modified queueing system GI|M|1,? Ann. Inst. Statist. Math.,15, No. 3, 207?213 (1964). · Zbl 0141.15903 · doi:10.1007/BF02865918
[1010] D. G. Tambouratzis, ?On a property of the variance of the waiting time of queue,? J. Appl. Probab.,5, No. 3, 702?703 (1968). · Zbl 0179.47905 · doi:10.1017/S0021900200114512
[1011] D. G. Tambouratzis, ?A note on Belyaev’s limiting distribution of the intervals between losses in an n-server system,? J. Appl. Probab.,7, No. 2, 457?464 (1970). · Zbl 0198.52604 · doi:10.1017/S0021900200035051
[1012] J. C. Tanner, ?The capacity of an uncontrolled intersection,? Biometrika,54, Nos. 3?4, 657?658 (1967). · doi:10.1093/biomet/54.3-4.657
[1013] A. C. Taylor, ?A Bayesian approach to equipment replacement,? Indust. Management Rev.,10, No. 3, 33?43 (1969).
[1014] J. Teghem, ?Du traitement semi-Markovien de modeles de files d’attente (resume),? Bull. Internat. Statist. Inst.,41, No. 2, 827?828 (1965).
[1015] J. G. C. Templeton, ?A problem suggested by a paper by R. F. Love: ?A queueing type inventory model with deterministic computing procedure,?? CORS Journal,5, No. 1, 47?48 (1967).
[1016] J. L. Teugels, ?Exponential ergodicity in Markov renewal processes,? J. Appl. Probabl,5, No. 2, 387?400 (1968). · doi:10.1017/S0021900200110071
[1017] K. Thiruvengadam, ?Queueing with breakdowns,? Operat. Res.,11, No. 1, 62?71 (1963). · Zbl 0109.36701 · doi:10.1287/opre.11.1.62
[1018] G. A. Thompson and W. K. Rapp, ?A rapid reliability estimator for redundant standby configurations,? Proc. Tenth Nat. Sympos. Reliability and Quality Control, Washington, D. C., 1964, Inst. Electr. and Electron. Engnrs., New York (1964), pp. 573?578.
[1019] J. Tomkó, ?A single-queue bulk service system with regard for server fallibility? [in Russian], Magyar Tud. Akad. Mat. Kutató Int. Kozl.,9, Nos. 1?2, 61?72 (1964).
[1020] J. Tomkó, ?Tömegkiszoigálási problémákról (I),? Magyar Tud. Akad. Mat. és Fiz. Tud. Oszt. Közl.,15, No. 3, 289?312 (1965).
[1021] J. Tomkó ?Tömegkiszolgálási problémákról (II),? Magyar Tud. Akad. Mat. és Fiz. Tud. Oszt. Közl.,16, No. 1, 1?16 (1966).
[1022] J. Tomkó, ?Tömegkiszolgálási problémákról (III),? Magyar Tud. Akad. Mat. és Fiz. Tud. Oszt. Közl.,17, No. 4, 435?446 (1967).
[1023] J. Tomkó, ?Stationary queue-length distribution in a single-queue system with regard for server fallibility? [in Russian], Magyar Tud. Akad. Mat. Kutato Int. Közl.,9, No. 3, 269?282 (1964?65).
[1024] J. Tomkó, ?A limit theorem in the service problem for an boundlessly increasing flow intensity? [in Russian], Studia Sci. Math. Hungar.,2, Nos. 3?4, 447?454 (1967).
[1025] J. Tomkó, ?Véges sorkapacitásu egykiszolgálós várakozási-idö problémaról,? Közl. Magyar Tud. Akad. Számitástechn. Közl.,3, 36?60 (1967).
[1026] J. Tomkó, ?Várakozási-idövel kapcsolatos hátareloszlás-tételekröl,? Közl. Magyar Tud. Akad. Számítástechn. Közl.,5, 51?71 (1969).
[1027] H. G. Tucker, ?Quasi-convergent series of independent random variables,? Amer.Math. Monthly,70, No. 7, 718?722 (1963). · Zbl 0118.33602 · doi:10.2307/2312252
[1028] Yoshiro Tumura, ?On the steady-state probabilities concerned with tandem queue,? TRU Math.,2, 1?11 (1966). · Zbl 0154.43401
[1029] Yoshiro Tumura, ?Equilibrium equations method in the generalized queueing problems,? TRU Math.,3, 48?61 (1967).
[1030] Yoshiro Tumura, ?On a queueing system M|G|m(m) having the priority order among service stations,? TRU Math.,4, 60?65 (1968). · Zbl 0186.24505
[1031] R. K. Tuteja, ?A queueing problem with correlated arrivals a finite number of servers,? CORS Journal,4, No. 3, 139?148 (1966). · Zbl 0143.20202
[1032] R. K. Tuteja, ?A queueing problem with arrivals depending on queue length and correlated departures,? Cahiers Centre Études Rech. Opérat.,10, No. 2, 100?113 (1968).
[1033] Kanehisa Udagawa and Shigeo Sato, ?The asymptotic behavior of the queueing processes with a Poisson input and exponentially distributed service times,? J. Operat. Res. Soc. Japan,8, No. 1, 1?15 (1965). · Zbl 0138.11702
[1034] Tosio Uematu, ?On some model of queueing systems with stats-dependent service-time distributions,? Ann. Inst. Statist. Math.,21, No. 1, 89?106 (1969). · Zbl 0184.44802 · doi:10.1007/BF02532234
[1035] I. A. Ushakov, ?On the effectiveness of one kind of system,? CORS Journal3., No. 3, 166?170 (1965).
[1036] O. Va?i?ek, ?Jedna speciálni ?ekací ?isciplína v systemu hromadné obsluhy,? Aplikace Mat.,10, No. 1, 59?71 (1965).
[1037] O. Va?i?ek, ?Poznámka k ?ekaçí disciplíne v systemech hromadné obsluhy,? Aplikace Mat.,10, No. 5, 423?427 (1965).
[1038] O. Va?i?ek, ?On the pre-emptive priority queues,? Kybernetika,3, No. 2, 147?156 (1967).
[1039] C. Venetis, ?A note on Moran’s probability theory of dams and storage systems,? Water Resources Res.,5, No. 4, 884?887 (1969). · doi:10.1029/WR005i004p00884
[1040] D. Vere-Jones, ?A rate-of-convergence problem in the theory of queues,? Teor. Veroyat. i Ee Prim.,9, No. 1, 104?112 (1964).
[1041] D. Vere-Jones, ?Some applications of probability-generating functionals to the study of input-output streams,? J. Roy. Statist. Soc.,B30, No. 2, 321?333 (1968). · Zbl 0165.19903
[1042] D. Vere-Jones, ?Some limit theorems for evanescent processes,? Austral. J. Statist.,11, No. 2, 67?78 (1969). · Zbl 0188.23302 · doi:10.1111/j.1467-842X.1969.tb00300.x
[1043] T. L. Vlach and R. L. Disney, ?The departure process from the GI|G|1 queue,? J. Appl. Probab.,6, No. 3, 704?707 (1969). · Zbl 0187.18106 · doi:10.1017/S0021900200026759
[1044] W. Voigt, ?Vergleichende Betrachtungen zur Nichtschlangentheorie und zur Theorie der Wartesysteme,? Wiss. Z. Hochschule Verkehrswesen Dresden,16, No. 1, 141?145 (1969).
[1045] D. F. Votaw, Jr., and L. G. Peck, ?Remarks on finite queueing tables,? Operat. Res.,16, No. 5, 1084?1086 (1968). · doi:10.1287/opre.16.5.1084
[1046] W. Wagner, ?On combined delay and loss systems with nonpreemptive priority service,? Fifth Internat. Teletraffic Congr., New York, 1967, Preprints Technical Papers, S. I., s.a., pp. 73?84.
[1047] J. Walter, ?Modely obnovy,? Ekon.-Mat. Obzor,5, No. 2, 137?162 (1969).
[1048] R. K. Wasan, ?The problem of dependability of a complex system having two types of components,? Management Sci.,11, No. 7, 751?754 (1965). · Zbl 0128.38901 · doi:10.1287/mnsc.11.7.751
[1049] Toitsu Watanabe, ?Approximation of transport process by transport chain,? Proc. Japan. Acad.,44, No. 7, 672?676 (1968). · Zbl 0181.20802 · doi:10.3792/pja/1195521090
[1050] P. Watermeyer and H. A. Thomas, Jr., ?Queueing theory and reservoir design,? Proc. Harvard Sympos. Digital Computers and Their Applications, Harvard Univ. Press, Cambridge, Mass. (1962), pp. 59?76.
[1051] B. Weesakul and G. F. Yeo, ?Some problems in finite dams with an application to insurance risk,? Z. Wahrscheinlichkeitstheor. und Verw. Geb.,2, No. 2, 135?146 (1963). · Zbl 0121.15003 · doi:10.1007/BF00531967
[1052] Chang Wei, ?Queueing with nonpreemptive and preemptive-resume priorities,? Operat. Res.,13, No. 6, 1020?1022 (1965). · Zbl 0129.10803 · doi:10.1287/opre.13.6.1020
[1053] G. D. Weinstock, ?Mathematical analysis of redundant systems solving the problem with matrix algebra,? Proc. Eighth Nat. Sympos. Reliability and Quality Control, Washington, D. C., 1962, Inst. Radio Engrs., New York (1962), pp. 142?147.
[1054] S. A. Weisberg and G. H. Sandier, ?Reliability of a redundant system with two failure modes,? Proc. Eleventh Nat. Sympos. Reliability and Quality Control, Miami Beach, Fla., 1965, Inst. Electr. and Electron. Engrs., New York (1965), pp. 575?579.
[1055] G. H. Weiss, ?An analysis of pedestrian queueing,? J. Res. Nat. Bur. Standards,B67, No. 4, 229?243 (1963). · Zbl 0218.60100 · doi:10.6028/jres.067B.018
[1056] P. D. Welch, ?On preemptive resume priority queues,? Ann. Math. Statist.,35, No. 2, 600?612 (1964). · Zbl 0123.35702 · doi:10.1214/aoms/1177703559
[1057] P. D. Welch, ?On a generalized M|G|1 queueing process in which the first customer of each busy period receives exceptional service,? Operat. Res.,12, No. 5, 736?752 (1964). · Zbl 0132.38404 · doi:10.1287/opre.12.5.736
[1058] W. Whitt, ?Multiple-channel queues in heavy traffic, III: Random server selection,? Adv. Appl. Probab.,2, No. 2, 370?375 (1970). · Zbl 0206.22601 · doi:10.1017/S0001867800037447
[1059] P.-T. Wilrich, ?Das Zeitverhalten von einfachen offenen exponentiellen Warteschlangensystemen mit unendlich vielen Warteplätzen,? Unternehmensforschung,12, No. 3, 185?209 (1968). · Zbl 0165.20004
[1060] U. H. Wittenberg, ?Zur Frage des Zuverlässigkeitgrades von Maschinen,? Unternehmensforschung,8, No. 2, 80?85 (1964).
[1061] R. W. Wolff, ?Work-conserving priorities,? J. Appl. Probab.,7, No. 2, 327?337 (1970). · Zbl 0212.50003 · doi:10.1017/S0021900200034914
[1062] R. Wormleighton, ?Queues at a fixed-time traffic signal with periodic random input,? CORS Journal,3, No. 3, 129?141 (1965).
[1063] Fang Wu, ?On the queueing process GI|M|n,? Scientia Sinica,11, No. 9, 1169?1182 (1962).
[1064] P. M. Wu, ?Storage with deterministic outputs and inputs subject to breakdown,? J. Appl. Probab.,5, No. 3, 636?647 (1968). · Zbl 0174.51502 · doi:10.1017/S0021900200114469
[1065] P. M. Wu, ?A note on storage with deterministic outputs and inputs subject to breakdown,? Austral. J. Statist.,12, No. 1, 28?32 (1970). · Zbl 0194.20804 · doi:10.1111/j.1467-842X.1970.tb00110.x
[1066] M. Yadin, ?Queueing with alternating priorities, treated as random walk on the lattice in the plane,? J. Appl. Probab.,7, No. 1, 196?218 (1970). · Zbl 0209.19804 · doi:10.1017/S0021900200027054
[1067] M. Yadin and P. Naor, ?Queueing systems with a removable service station,? Operat. Res. Quart.,14, No. 4, 393?405 (1963). · doi:10.1057/jors.1963.63
[1068] M. Yadin and P. Naor, ?On queueing systems with variable service capacities,? Nav. Res. Log. Quart.,14, No. 1, 43?53 (1967). · Zbl 0171.16204 · doi:10.1002/nav.3800140105
[1069] G. F. Yeo, ?The time-dependent solution for a dam with geometric inputs,? Austral. J. Appl. Sci.,11, No. 4, 434?442 (1960).
[1070] G. F. Yeo, ?The time-dependent solution for an infinite dam with discrete additive inputs,? J. Roy. Statist. Soc.,B23, No. 1, 173?179 (1961). · Zbl 0104.38704
[1071] G. F. Yeo, ?Preemptive priority queues,? J. Austral. Math. Soc.,3, No. 4, 491?502 (1963). · Zbl 0209.19901 · doi:10.1017/S1446788700039124
[1072] G. F. Yeo and B. Weesakul, ?Delays to road traffic at an intersection,? J. Appl. Probab.,1, No. 2, 297?310 (1964). · Zbl 0199.23402 · doi:10.1017/S0021900200108411
[1073] Tokumasa Yottani, ?On a warehousing problem of two kinds of commodity,? Res. Bull. Fac. Educat. Oita Univ. Nat. Sci.,3, No. 4, 5?9 (1969).
[1074] J. P. Young, ?Administrative control of multiple-channel queueing systems with parallel input streams,? Operat. Res.,14, No. 1, 145?156 (1966). · doi:10.1287/opre.14.1.145
[1075] F. Zítek, ?Poznámka k teorii vstupních proudu,? Casop. P?stov. Mat.,88, No. 2, 209?210 (1963).
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.