Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Kelly, F. P.
1976.
Networks of queues.
Advances in Applied Probability,
Vol. 8,
Issue. 2,
p.
416.
Schassberger, R.
1978.
The insensitivity of stationary probabilities in networks of queues.
Advances in Applied Probability,
Vol. 10,
Issue. 4,
p.
906.
Schassberger, R.
1978.
Insensitivity of steady-state distributions of generalized semi-Markov processes by speeds.
Advances in Applied Probability,
Vol. 10,
Issue. 4,
p.
836.
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.
Melamed, Benjamin
1979.
Characterizations of Poisson traffic streams in Jackson queueing networks.
Advances in Applied Probability,
Vol. 11,
Issue. 2,
p.
422.
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.
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. 3,
p.
660.
Kaufman, J.
1981.
Blocking in a Shared Resource Environment.
IEEE Transactions on Communications,
Vol. 29,
Issue. 10,
p.
1474.
Burman, David Y.
1981.
Insensitivity in queueing systems.
Advances in Applied Probability,
Vol. 13,
Issue. 4,
p.
846.
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.
Barbour, A. D.
and
Schassberger, R.
1981.
Insensitive average residence times in generalized semi-Markov processes.
Advances in Applied Probability,
Vol. 13,
Issue. 04,
p.
720.
Smith, J. MacGregor
1982.
An analytical queuing network computer program for the optimal egress problem.
Fire Technology,
Vol. 18,
Issue. 1,
p.
18.
Smith, J.MacGregor
1982.
Queuing networks and facility planning.
Building and Environment,
Vol. 17,
Issue. 1,
p.
33.
1982.
The Single Server Queue.
Vol. 8,
Issue. ,
p.
676.
Gallego, J. Aranda
1982.
Algunas relaciones entre modelos Marcovianos de redes de colas.
Trabajos de Estadistica y de Investigacion Operativa,
Vol. 33,
Issue. 3,
p.
3.
Sevcik, Kenneth C.
1982.
Deterministic and Stochastic Scheduling.
p.
211.
Hordijk, A.
and
van Dijk, N.
1982.
Applied Probability— Computer Science: The Interface.
p.
423.
Barbour, A. D.
1982.
Generalized semi-Markov schemes and open queueing networks.
Journal of Applied Probability,
Vol. 19,
Issue. 02,
p.
469.
Henderson, W.
1983.
Insensitivity and reversed Markov processes.
Advances in Applied Probability,
Vol. 15,
Issue. 04,
p.
752.
K�nig, D.
Rykov, V. V.
and
Schmidt, V.
1983.
Stationary queuing systems with dependencies.
Journal of Soviet Mathematics,
Vol. 21,
Issue. 6,
p.
938.