Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Barbour, Andrew D.
1976.
Networks of queues and the method of stages.
Advances in Applied Probability,
Vol. 8,
Issue. 3,
p.
584.
Kelly, F. P.
1976.
The departure process from a queueing system.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 80,
Issue. 2,
p.
283.
Schassberger, R.
1978.
The insensitivity of stationary probabilities in networks of queues.
Advances in Applied Probability,
Vol. 10,
Issue. 04,
p.
906.
Gaver, Donald P.
1978.
Comment.
Journal of the American Statistical Association,
Vol. 73,
Issue. 363,
p.
522.
Schassberger, R.
1978.
Insensitivity of steady-state distributions of generalized semi-Markov processes by speeds.
Advances in Applied Probability,
Vol. 10,
Issue. 04,
p.
836.
Nummelin, E.
1979.
A conservation property for general GI/G/1 queues with an application to tandem queues.
Advances in Applied Probability,
Vol. 11,
Issue. 03,
p.
660.
Melamed, Benjamin
1979.
On Poisson traffic processes in discrete-state Markovian systems by applications to queueing theory.
Advances in Applied Probability,
Vol. 11,
Issue. 1,
p.
218.
Smith, J. Macgregor
and
Rouse, Nilliam B.
1979.
Application of Queueing Network Models to Optimization of Resource Allocation within Libraries.
Journal of the American Society for Information Science,
Vol. 30,
Issue. 5,
p.
250.
Boxma, O. J.
1979.
On a tandem queueing model with identical service times at both counters, I.
Advances in Applied Probability,
Vol. 11,
Issue. 03,
p.
616.
Melamed, Benjamin
1979.
Characterizations of Poisson traffic streams in Jackson queueing networks.
Advances in Applied Probability,
Vol. 11,
Issue. 02,
p.
422.
Towsley, Don
1980.
Queuing Network Models with State-Dependent Routing.
Journal of the ACM,
Vol. 27,
Issue. 2,
p.
323.
Walrand, Jean
and
Varaiya, Pravin
1980.
Interconnections of Markov chains and quasi-reversible queuing networks.
Stochastic Processes and their Applications,
Vol. 10,
Issue. 2,
p.
209.
Sevcik, K. C.
and
Mitrani, I.
1981.
The Distribution of Queuing Network States at Input and Output Instants.
Journal of the ACM,
Vol. 28,
Issue. 2,
p.
358.
Schassberger, R.
1981.
The doubly stochastic server: A time-sharing model.
Zeitschrift für Operations Research,
Vol. 25,
Issue. 7,
p.
179.
Brémaud, Pierre
1981.
Point Processes and Queues.
p.
122.
Smith, J. Macgregor
1981.
The use of queuing networks and mixed integer programming to allocate resources optimally within a library layout.
Journal of the American Society for Information Science,
Vol. 32,
Issue. 1,
p.
33.
Solberg, James J.
1981.
Capacity Planning with a Stochastic Workflow Model.
A I I E Transactions,
Vol. 13,
Issue. 2,
p.
116.
Barbour, A. D.
and
Schassberger, R.
1981.
Insensitive average residence times in generalized semi-Markov processes.
Advances in Applied Probability,
Vol. 13,
Issue. 4,
p.
720.
Burman, David Y.
1981.
Insensitivity in queueing systems.
Advances in Applied Probability,
Vol. 13,
Issue. 4,
p.
846.
Melamed, Benjamin
1982.
On the reversibility of queueing networks.
Stochastic Processes and their Applications,
Vol. 13,
Issue. 2,
p.
227.