Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Sonderman, David
1979.
Comparing multi-server queues with finite waiting rooms, I: Same number of servers.
Advances in Applied Probability,
Vol. 11,
Issue. 2,
p.
439.
Sonderman, David
1979.
Comparing multi-server queues with finite waiting rooms, II: Different numbers of servers.
Advances in Applied Probability,
Vol. 11,
Issue. 2,
p.
448.
Sonderman, David
1979.
Comparing multi-server queues with finite waiting rooms, II: Different numbers of servers.
Advances in Applied Probability,
Vol. 11,
Issue. 2,
p.
448.
Whitt, Ward
1981.
Comparing counting processes and queues.
Advances in Applied Probability,
Vol. 13,
Issue. 1,
p.
207.
Smith, D. R.
and
Whitt, W.
1981.
Resource Sharing for Efficiency in Traffic Systems.
Bell System Technical Journal,
Vol. 60,
Issue. 1,
p.
39.
Courcoubetis, C.
and
Varaiya, P.
1983.
The serving process with least thinking time maximizes resource utilization.
p.
1181.
Courcoubetis, C.
and
Varaiya, P.
1984.
Serving process with least thinking time maximizes resource utilization.
IEEE Transactions on Automatic Control,
Vol. 29,
Issue. 11,
p.
1005.
Bhaskaran, B. G.
1986.
Almost sure comparison of birth and death processes with application to M/M/s queueing systems.
Queueing Systems,
Vol. 1,
Issue. 1,
p.
103.
Shanthikumar, J. George
and
Yao, David D.
1987.
Comparing ordered-entry queues with heterogeneous servers.
Queueing Systems,
Vol. 2,
Issue. 3,
p.
235.
Kiessler, Peter C.
and
Disney, Ralph L.
1988.
Further remarks on queueing network theory.
European Journal of Operational Research,
Vol. 36,
Issue. 3,
p.
285.
Heyman, Daniel P.
and
Whitt, Ward
1989.
Limits for queues as the waiting room grows.
Queueing Systems,
Vol. 5,
Issue. 4,
p.
381.
Bhattachary, Partha P.
and
Ephremides, Anthony
1991.
Stochastic monotonicity properties of multiserver queues with impatient customers.
Journal of Applied Probability,
Vol. 28,
Issue. 03,
p.
673.
Berger, Arthur W.
and
Ward, Whitt
1992.
Comparisons of multi-server queues with finite waiting rooms.
Communications in Statistics. Stochastic Models,
Vol. 8,
Issue. 4,
p.
719.
Berger, Arthur W.
and
Whitt, Ward
1992.
The impact of a job buffer in a token-bank rate-control throttle.
Communications in Statistics. Stochastic Models,
Vol. 8,
Issue. 4,
p.
685.
Whitt, Ward
1992.
Counterexamples for comparisons of queues with finite waiting rooms.
Queueing Systems,
Vol. 10,
Issue. 3,
p.
271.
Boxma, O.J.
and
de Waal, P.R.
1994.
The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks.
Vol. 1,
Issue. ,
p.
743.
Perry, David
and
Asmussen, S�oren
1995.
Rejection rules in theM/G/1 queue.
Queueing Systems,
Vol. 19,
Issue. 1-2,
p.
105.
Dallery, Yves
and
Truffet, Laurent
2000.
Bounds on the end-to-end loss probability for queues in Series with Finite Capacity.
Communications in Statistics. Stochastic Models,
Vol. 16,
Issue. 5,
p.
557.
Foley, Robert D.
and
Park, Byung Chun
2002.
Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers.
Operations Research Letters,
Vol. 30,
Issue. 1,
p.
19.
MEDHI, J.
2003.
Stochastic Models in Queueing Theory.
p.
65.