Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Blanc, J.P.C.
1987.
On a numerical method for calculating state probabilities for queueing systems with more than one waiting line.
Journal of Computational and Applied Mathematics,
Vol. 20,
Issue. ,
p.
119.
Gubner, John A.
Gopinath, B.
and
Varadhan, S. R. S.
1989.
Bounding functions of Markov processes and the shortest queue problem.
Advances in Applied Probability,
Vol. 21,
Issue. 4,
p.
842.
Nelson, R. D.
and
Philips, T. K.
1989.
An approximation to the response time for shortest queue routing.
p.
181.
Nelson, R. D.
and
Philips, T. K.
1989.
An approximation to the response time for shortest queue routing.
ACM SIGMETRICS Performance Evaluation Review,
Vol. 17,
Issue. 1,
p.
181.
Blanc, J. P. C.
1990.
A numerical approach to cyclic-service queueing models.
Queueing Systems,
Vol. 6,
Issue. 1,
p.
173.
Lui, John C. S.
and
Muntz, Richard R.
1992.
Algorithmic approach to bounding the mean response time of a minimum expected delay routing system.
ACM SIGMETRICS Performance Evaluation Review,
Vol. 20,
Issue. 1,
p.
140.
Lin, H.-C.
and
Raghavendra, C.S.
1992.
An analysis of the join the shortest queue (JSQ) policy.
p.
362.
Lui, John C. S.
and
Muntz, Richard R.
1992.
Algorithmic approach to bounding the mean response time of a minimum expected delay routing system.
p.
140.
Blanc, J. P. C.
1992.
Performance evaluation of polling systems by means of the power-series algorithm.
Annals of Operations Research,
Vol. 35,
Issue. 3,
p.
155.
Nelson, Randolph D.
and
Philips, Thomas K.
1993.
An approximation for the mean response time for shortest queue routing with general interarrival and service times.
Performance Evaluation,
Vol. 17,
Issue. 2,
p.
123.
Blanc, Hans J. P. C.
1993.
Performance Evaluation of Computer and Communication Systems.
Vol. 729,
Issue. ,
p.
53.
Sundaram, C. R. M.
and
Narahari, Y.
1993.
Application and Theory of Petri Nets 1993.
Vol. 691,
Issue. ,
p.
397.
Lui, J.C.S.
Muntz, R.R.
and
Towsley, D.
1995.
Bounding the mean response time of the minimum expected delay routing policy: an algorithmic approach.
IEEE Transactions on Computers,
Vol. 44,
Issue. 12,
p.
1371.
Lin, Hwa-Chun
and
Raghavendra, C.S.
1996.
Approximating the mean response time of parallel queues with JSQ policy.
Computers & Operations Research,
Vol. 23,
Issue. 8,
p.
733.
Wu, P.
and
Posner, M.J.M.
1997.
A level-crossing approach to the solution of the shortest-queue problem.
Operations Research Letters,
Vol. 21,
Issue. 4,
p.
181.
Kraus, Sarit
and
Plotkin, Tatjana
2000.
Algorithms of distributed task allocation for cooperative agents.
Theoretical Computer Science,
Vol. 242,
Issue. 1-2,
p.
1.
Blanc, Hans
2008.
Bad Luck When Joining the Shortest Queue.
SSRN Electronic Journal,
Blanc, J.P.C.
2009.
Bad luck when joining the shortest queue.
European Journal of Operational Research,
Vol. 195,
Issue. 1,
p.
167.
Dorsman, J.L.
van der Mei, R.D.
and
Vlasiou, M.
2013.
Analysis of a two-layered network by means of the power-series algorithm.
Performance Evaluation,
Vol. 70,
Issue. 12,
p.
1072.
Bar-Lev, Shaul K.
Blanc, Hans
Boxma, Onno
Janssen, Guido
and
Perry, David
2013.
Tandem Queues with Impatient Customers for Blood Screening Procedures.
Methodology and Computing in Applied Probability,
Vol. 15,
Issue. 2,
p.
423.