Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Pinedo, Michael
and
Schrage, Linus
1982.
Deterministic and Stochastic Scheduling.
p.
181.
Pinedo, Michael
1984.
Optimal policies in stochastic shop scheduling.
Annals of Operations Research,
Vol. 1,
Issue. 3,
p.
305.
Whitt, Ward
1984.
Approximations for departure processes and queues in series.
Naval Research Logistics Quarterly,
Vol. 31,
Issue. 4,
p.
499.
Lehtonen, Tapani
1986.
On the ordering of tandem queues with exponential servers.
Journal of Applied Probability,
Vol. 23,
Issue. 01,
p.
115.
Anantharam, V.
1987.
Probabilistic proof of the interchangeability of ./M/1 queues in series.
Queueing Systems,
Vol. 2,
Issue. 4,
p.
387.
Tsoucas, Pantelis
and
Walrand, Jean
1987.
On the interchangeability and stochastic ordering of ·/M/1 queues in tandem.
Advances in Applied Probability,
Vol. 19,
Issue. 2,
p.
515.
Parekh, Shyam
and
Walrand, Jean
1988.
Stochastic Differential Systems, Stochastic Control Theory and Applications.
Vol. 10,
Issue. ,
p.
439.
Parekh, S.
and
Walrand, J.
1989.
A quick simulation method for excessive backlogs in networks of queues.
IEEE Transactions on Automatic Control,
Vol. 34,
Issue. 1,
p.
54.
Chao, Xiuli
Pinedo, Michael
and
Sigman, Karl
1989.
On the Interchangeability and Stochastic Ordering of Exponential Queues in Tandem with Blocking.
Probability in the Engineering and Informational Sciences,
Vol. 3,
Issue. 2,
p.
223.
Walrand, Jean
1990.
Stochastic Models.
Vol. 2,
Issue. ,
p.
519.
Kijima, Masaaki
and
Makimoto, Naoki
1990.
On interchangeability for exponential single-server queues in tandem.
Journal of Applied Probability,
Vol. 27,
Issue. 2,
p.
459.
Ding, Jie
and
Greenberg, Betsy S.
1991.
Bowl Shapes Are Better with Buffers–Sometimes.
Probability in the Engineering and Informational Sciences,
Vol. 5,
Issue. 2,
p.
159.
Ding, Jie
and
Greenberg, Betsy S.
1991.
Optimal Order for Servers in Series with No Queue Capacity.
Probability in the Engineering and Informational Sciences,
Vol. 5,
Issue. 4,
p.
449.
Chao, Xiuli
1992.
On the departure processes of M/M/1/N and GI/G/1/N queues.
Advances in Applied Probability,
Vol. 24,
Issue. 03,
p.
751.
Yi-Min Xie
1992.
A note on optimal order of M machines in tandem with blocking.
p.
1197.
Chao, Xiuli
and
Pinedo, Michael
1992.
On reversibility of tandem queues with blocking.
Naval Research Logistics,
Vol. 39,
Issue. 7,
p.
957.
Tsoucas, Pantelis
1992.
Rare events in series of queues.
Journal of Applied Probability,
Vol. 29,
Issue. 1,
p.
168.
Weber, Richard R.
1992.
The interchangeability of tandem queues with heterogeneous customers and dependent service times.
Advances in Applied Probability,
Vol. 24,
Issue. 3,
p.
727.
Liao, Ching-Jong
and
Rosenshine, Matthew
1992.
A heuristic for determining the optimal order in a tandem queue.
Computers & Operations Research,
Vol. 19,
Issue. 2,
p.
133.
Lawler, Eugene L.
Lenstra, Jan Karel
Rinnooy Kan, Alexander H.G.
and
Shmoys, David B.
1993.
Logistics of Production and Inventory.
Vol. 4,
Issue. ,
p.
445.