Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Ott, Teunis J.
1984.
The sojourn-time distribution in the M/G/1 queue by processor sharing.
Journal of Applied Probability,
Vol. 21,
Issue. 2,
p.
360.
Cohen, J. W.
1984.
On processor sharing and random service.
Journal of Applied Probability,
Vol. 21,
Issue. 04,
p.
937.
Cohen, J. W.
1984.
On processor sharing and random service.
Journal of Applied Probability,
Vol. 21,
Issue. 4,
p.
937.
Gaver, Donald P.
and
Jacobs, Patricia A.
1986.
Processor-Shared Time-Sharing Models in Heavy Traffic.
SIAM Journal on Computing,
Vol. 15,
Issue. 4,
p.
1085.
Coffman, E.G.
Fayolle, G.
and
Mitrani, I.
1986.
Sojourn times in a tandem queue with overtaking: reduction to a boundary value problem.
Communications in Statistics. Stochastic Models,
Vol. 2,
Issue. 1,
p.
43.
Yashkov, S. F.
1987.
Processor-sharing queues: Some progress in analysis.
Queueing Systems,
Vol. 2,
Issue. 1,
p.
1.
Shanthikumar, J. George
and
Sumita, Ushio
1987.
Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines.
Journal of Applied Probability,
Vol. 24,
Issue. 3,
p.
737.
Shanthikumar, J. George
and
Sumita, Ushio
1987.
Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplines.
Journal of Applied Probability,
Vol. 24,
Issue. 03,
p.
737.
Halfin, Shlomo
and
Whitt, Ward
1989.
An extremal property of the fifo discipline via an ordinal version of.
Communications in Statistics. Stochastic Models,
Vol. 5,
Issue. 3,
p.
515.
Kelly-Bootle, Stan
and
Lutek, Ben W.
1990.
Probability, Statistics, and Queuing Theory with Computer Science Applications.
p.
247.
Charles, Knessl
1992.
Asymptotic approximations for the gi/m/1 queue with processor-sharing service.
Communications in Statistics. Stochastic Models,
Vol. 8,
Issue. 1,
p.
1.
Yashkov, S. F.
1992.
Mathematical problems in the theory of shared-processor systems.
Journal of Soviet Mathematics,
Vol. 58,
Issue. 2,
p.
101.
Tan, Xiaoming
and
Knessl, Charles
1993.
Sojourn time distribution in some processor-shared queues.
European Journal of Applied Mathematics,
Vol. 4,
Issue. 4,
p.
437.
Yang, Yongzhi
and
Knessl, Charles
1993.
The Conditional Sojourn Time Distribution in the GI/M/1 Processor-Sharing Queue in Heavy Traffic.
SIAM Journal on Applied Mathematics,
Vol. 53,
Issue. 4,
p.
1132.
Tan, Xiaoming
Yang, Yongzhi
and
Knessl, Charles
1993.
The conditional sojourn time distribution in the GI/M/1 processor-sharing queue in heavy traffic.
Queueing Systems,
Vol. 14,
Issue. 1-2,
p.
99.
Yang, Yongzhi
and
Knessl, Charles
1994.
The Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing Service.
Studies in Applied Mathematics,
Vol. 93,
Issue. 1,
p.
29.
Altman, Eitan
and
Shimkin, Nahum
1998.
Individual Equilibrium and Learning in Processor Sharing Systems.
Operations Research,
Vol. 46,
Issue. 6,
p.
776.
Borst, S.C.
Boxma, O.J.
Morrison, J.A.
and
Núñez Queija, R.
2003.
The equivalence between processor sharing and service in random order.
Operations Research Letters,
Vol. 31,
Issue. 4,
p.
254.
Masuyama, Hiroyuki
and
Takine, Tetsuya
2003.
Sojourn time distribution in a MAP/M/1 processor-sharing queue.
Operations Research Letters,
Vol. 31,
Issue. 5,
p.
406.
Kim, Jeongsim
and
Kim, Bara
2004.
Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing.
Performance Evaluation,
Vol. 58,
Issue. 4,
p.
341.