Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Bitran, Gabriel R.
and
Dasu, Sriram
1992.
A review of open queueing network models of manufacturing systems.
Queueing Systems,
Vol. 12,
Issue. 1-2,
p.
95.
Laws, C. N.
1992.
Resource pooling in queueing networks with dynamic routing.
Advances in Applied Probability,
Vol. 24,
Issue. 3,
p.
699.
Laws, C. N.
1992.
Resource pooling in queueing networks with dynamic routing.
Advances in Applied Probability,
Vol. 24,
Issue. 3,
p.
699.
Kelly, F. P.
and
Laws, C. N.
1993.
Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling.
Queueing Systems,
Vol. 13,
Issue. 1-3,
p.
47.
Stidham, Shaler
and
Weber, Richard
1993.
A survey of Markov decision models for control of networks of queues.
Queueing Systems,
Vol. 13,
Issue. 1-3,
p.
291.
Wein, Lawrence M.
1994.
Stochastic Modeling and Analysis of Manufacturing Systems.
p.
281.
Fendick, K.W.
and
Rodrigues, M.A.
1994.
Asymptotic analysis of adaptive rate control for diverse sources with delayed feedback.
IEEE Transactions on Information Theory,
Vol. 40,
Issue. 6,
p.
2008.
Kelly, F. P.
1995.
Stochastic Networks.
Vol. 71,
Issue. ,
p.
169.
Gelenbe, Erol
Seshadri, Sridhar
and
Srinivasan, Vijay
1995.
Performance Modelling and Evaluation of ATM Networks.
p.
458.
Hariharan, Rema
Moustafa, Magdi S.
and
Stidham, Shaler
1996.
Scheduling in a multi-class series of queues with deterministic service times.
Queueing Systems,
Vol. 24,
Issue. 1-4,
p.
83.
Martins, L. F.
Shreve, S. E.
and
Soner, H. M.
1996.
Heavy Traffic Convergence of a Controlled, Multiclass Queueing System.
SIAM Journal on Control and Optimization,
Vol. 34,
Issue. 6,
p.
2133.
Calvert, Bruce
Solomon, Wiremu
and
Ziedins, Ilze
1997.
Braess's paradox in a queueing network with state-dependent routing.
Journal of Applied Probability,
Vol. 34,
Issue. 1,
p.
134.
Calvert, Bruce
Solomon, Wiremu
and
Ziedins, Ilze
1997.
Braess's paradox in a queueing network with state-dependent routing.
Journal of Applied Probability,
Vol. 34,
Issue. 01,
p.
134.
Harrison, J. Michael
and
Van Mieghem, Jan A.
1997.
Dynamic control of Brownian networks: state space collapse and equivalent workload formulations.
The Annals of Applied Probability,
Vol. 7,
Issue. 3,
Mithal, S.
1998.
Bounds on end-to-end performance via greedy, multi-path routing in integrated services networks.
Vol. 1,
Issue. ,
p.
19.
Martinelli, F.
and
Valigi, P.
1998.
A dynamic control problem for a two part-type pull manufacturing system.
Vol. 3,
Issue. ,
p.
2753.
Bell, S.L.
and
Williams, R.J.
1999.
Dynamic scheduling of a system with two parallel servers: asymptotic policy in heavy traffic.
Vol. 3,
Issue. ,
p.
2255.
Harrison, J. Michael
2000.
Brownian models of open processing networks: canonical representation of workload.
The Annals of Applied Probability,
Vol. 10,
Issue. 1,
Nam, Ick-Hyun
2001.
Dynamic Scheduling for a Flexible Processing Network.
Operations Research,
Vol. 49,
Issue. 2,
p.
305.
Bell, S. L.
and
Williams, R. J.
2001.
Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: asymptotic optimality of a threshold policy.
The Annals of Applied Probability,
Vol. 11,
Issue. 3,