Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Baras, J. S.
Dorsey, A. J.
and
Makowski, A. M.
1985.
Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal.
Advances in Applied Probability,
Vol. 17,
Issue. 1,
p.
186.
Nain, Philippe
and
Ross, Keith
1986.
Optimal multiplexing of heterogeneous traffic with hard constraint.
ACM SIGMETRICS Performance Evaluation Review,
Vol. 14,
Issue. 1,
p.
100.
Betró, B.
Schoen, F.
and
Speranza, M. G.
1986.
System Modelling and Optimization.
Vol. 84,
Issue. ,
p.
75.
Nain, P.
and
Ross, K.
1986.
Optimal priority assignment with hard constraint.
IEEE Transactions on Automatic Control,
Vol. 31,
Issue. 10,
p.
883.
Betrò, Bruno
Schoen, Fabio
and
Speranza, M.Grazia
1987.
Dynamic estimation of queue behaviour in urban traffic.
European Journal of Operational Research,
Vol. 31,
Issue. 3,
p.
368.
Hofri, Micha
and
Ross, Keith W.
1987.
On the Optimal Control of Two Queues with Server Setup Times and Its Analysis.
SIAM Journal on Computing,
Vol. 16,
Issue. 2,
p.
399.
Righter, Rhonda
1988.
Job scheduling to minimize expected weighted flowtime on uniform processors.
Systems & Control Letters,
Vol. 10,
Issue. 4,
p.
211.
Jung-Bong Suk
and
Cassandras, C.G.
1988.
Optimal scheduling of two competing queues with blocking.
p.
1102.
Altman, E.
and
Shwartz, A.
1988.
Markov optimization problems: state-action frequencies revisited.
p.
640.
Ross, K.W.
and
Yao, D.D.
1989.
Optimal dynamic scheduling in Jackson networks.
IEEE Transactions on Automatic Control,
Vol. 34,
Issue. 1,
p.
47.
Nain, Philippe
Tsoucas, Pantelis
and
Walrand, Jean
1989.
Interchange arguments in stochastic scheduling.
Journal of Applied Probability,
Vol. 26,
Issue. 04,
p.
815.
Nain, Philippe
Tsoucas, Pantelis
and
Walrand, Jean
1989.
Interchange arguments in stochastic scheduling.
Journal of Applied Probability,
Vol. 26,
Issue. 4,
p.
815.
Milito, R.A.
and
Levy, H.
1989.
Modeling and dynamic scheduling of a queueing system with blocking and starvation.
IEEE Transactions on Communications,
Vol. 37,
Issue. 12,
p.
1318.
Righter, Rhonda
and
Shanthikumar, J. George
1989.
Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures.
Probability in the Engineering and Informational Sciences,
Vol. 3,
Issue. 3,
p.
323.
Altman, E.
and
Shwartz, A.
1989.
Optimal priority assignment: a time sharing approach.
IEEE Transactions on Automatic Control,
Vol. 34,
Issue. 10,
p.
1098.
Hirayama, T.
1989.
Optimal service assignment in a finite-source queue.
IEEE Transactions on Automatic Control,
Vol. 34,
Issue. 1,
p.
67.
Hirayama, Tetsuji
Kijima, Masaaki
and
Nishimura, Shoichi
1989.
Further results for dynamic scheduling of multiclass G/G/1 queues.
Journal of Applied Probability,
Vol. 26,
Issue. 03,
p.
595.
Suk, J.-B.
and
Cassandras, C.G.
1989.
Optimal control of a storage-retrieval queuing system.
p.
1093.
Nain, Philippe
1989.
Interchange arguments for classical scheduling problems in queues.
Systems & Control Letters,
Vol. 12,
Issue. 2,
p.
177.
Ephremides, A.
and
Verdu, S.
1989.
Control and optimization methods in communication network problems.
IEEE Transactions on Automatic Control,
Vol. 34,
Issue. 9,
p.
930.