Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
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.
Adan, Ivo
Boxma, Onno
and
Perry, David
2005.
The G/M/1 queue revisited.
Mathematical Methods of Operations Research,
Vol. 62,
Issue. 3,
p.
437.
Raz, David
Levy, Hanoch
and
Avi-Itzhak, Benjamin
2010.
Class prioritization and server dedication in queueing systems: Discrimination and fairness aspects.
Performance Evaluation,
Vol. 67,
Issue. 4,
p.
235.
Haviv, Moshe
and
Kerner, Yoav
2011.
The age of the arrival process in the G/M/1 and M/G/1 queues.
Mathematical Methods of Operations Research,
Vol. 73,
Issue. 1,
p.
139.
Boxma, Onno J.
2011.
Wiley Encyclopedia of Operations Research and Management Science.
Korolkova, L.
and
Mashrabov, N.
2016.
Limits for GI/GI/N queues.
p.
1.
Lakner, Peter
Reed, Josh
and
Simatos, Florian
2017.
Scaling Limit of a Limit Order Book Model via the Regenerative Characterization of Lévy Trees.
Stochastic Systems,
Vol. 7,
Issue. 2,
p.
342.
Oz, Binyamin
Adan, Ivo
and
Haviv, Moshe
2017.
A rate balance principle and its application to queueing models.
Queueing Systems,
Vol. 87,
Issue. 1-2,
p.
95.
Lakner, Peter
Reed, Josh
and
Simatos, Florian
2018.
Scaling Limit of a Limit Order Book Model via the Regenerative Characterization of Lévy Trees.
Stochastic Systems,
Vol. 2018,
Issue. 1,
p.
1.