Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Ramaswami, V.
1984.
The sojourn time in the GI/M/1 queue by processor sharing.
Journal of Applied Probability,
Vol. 21,
Issue. 2,
p.
437.
Yashkov, S.F
1985.
Distribution of number of jobs in a feedback processor-sharing queue.
Annual Review in Automatic Programming,
Vol. 12,
Issue. ,
p.
464.
Sengupta, B.
and
Jagerman, D. L.
1985.
A Conditional Response Time of the M/M/1 Processor-Sharing Queue.
AT&T Technical Journal,
Vol. 64,
Issue. 2,
p.
409.
Cooper, Robert B.
and
Niu, Shun-Chen
1986.
Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO.
Journal of Applied Probability,
Vol. 23,
Issue. 2,
p.
550.
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.
Cooper, Robert B.
and
Niu, Shun-Chen
1986.
Benes's formula for M/G/1–FIFO ‘explained' by preemptive-resume LIFO.
Journal of Applied Probability,
Vol. 23,
Issue. 2,
p.
550.
Yashkov, S. F.
1987.
Processor-sharing queues: Some progress in analysis.
Queueing Systems,
Vol. 2,
Issue. 1,
p.
1.
Avi-Itzhak, Benjamin
and
Halfin, Shlomo
1987.
Server sharing with a limited number of service positions and symmetric queues.
Journal of Applied Probability,
Vol. 24,
Issue. 4,
p.
990.
Avi-Itzhak, Benjamin
and
Halfin, Shlomo
1987.
Server sharing with a limited number of service positions and symmetric queues.
Journal of Applied Probability,
Vol. 24,
Issue. 04,
p.
990.
Avi-Itzhak, Benjamin
and
Halfin, Shlomo
1988.
Response times in M/M/1 time-sharing schemes with limited number of service positions.
Journal of Applied Probability,
Vol. 25,
Issue. 3,
p.
579.
Avi-Itzhak, Benjamin
and
Halfin, Shlomo
1988.
Response times in M/M/1 time-sharing schemes with limited number of service positions.
Journal of Applied Probability,
Vol. 25,
Issue. 03,
p.
579.
Grishechkin, S. A.
1988.
Single-channel system with circular access or processor-sharing and branching processes.
Mathematical Notes of the Academy of Sciences of the USSR,
Vol. 44,
Issue. 4,
p.
716.
Foley, R. D.
and
Klutke, Georgia-Ann
1989.
Stationary increments in the accumulated work process in processor-sharing queues.
Journal of Applied Probability,
Vol. 26,
Issue. 03,
p.
671.
van den Berg, J. L.
1989.
Messung, Modellierung und Bewertung von Rechensystemen und Netzen.
Vol. 218,
Issue. ,
p.
105.
Jagerman, David L.
and
Sengupta, Bhaskar
1989.
A Functional Equation Arising in a Queue With a Gating Mechanism.
Probability in the Engineering and Informational Sciences,
Vol. 3,
Issue. 3,
p.
417.
Sengupta, Bhaskar
1989.
A perturbation method for solving some queues with processor sharing discipline.
Journal of Applied Probability,
Vol. 26,
Issue. 1,
p.
209.
Sengupta, Bhaskar
1989.
A perturbation method for solving some queues with processor sharing discipline.
Journal of Applied Probability,
Vol. 26,
Issue. 01,
p.
209.
Foley, R. D.
and
Klutke, Georgia-Ann
1989.
Stationary increments in the accumulated work process in processor-sharing queues.
Journal of Applied Probability,
Vol. 26,
Issue. 3,
p.
671.
van den Berg, J. L.
and
Boxma, O. J.
1989.
Operations Research Proceedings 1988.
Vol. 1988,
Issue. ,
p.
247.
van den Berg, J.L.
Boxma, O. J.
and
Groenendijk, W. P.
1989.
Sojourn times in the m/g/1 queue with deterministic feedback.
Communications in Statistics. Stochastic Models,
Vol. 5,
Issue. 1,
p.
115.