Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Milito, R.A.
and
Fernandez-Gaucherand, E.
1995.
Routing arrivals to M parallel queues.
Vol. 2,
Issue. ,
p.
1415.
Altman, Eitan
and
Hordijk, Arie
1997.
Applications of Borovkov's Renovation Theory to Non-Stationary Stochastic Recursive Sequences and Their Control.
Advances in Applied Probability,
Vol. 29,
Issue. 2,
p.
388.
Koole, Ger
1998.
A transformation method for stochastic control problems with partial observations.
Systems & Control Letters,
Vol. 35,
Issue. 5,
p.
301.
Hordijk, Arie
Loeve, Anneke
and
Tiggelman, Jeroen
1998.
Analysis of a finite-source customer assignment model with no state information.
Mathematical Methods of Operations Research,
Vol. 47,
Issue. 2,
p.
317.
Koole, G.
1999.
On the static assignment to parallel servers.
IEEE Transactions on Automatic Control,
Vol. 44,
Issue. 8,
p.
1588.
Altman, Eitan
Gaujal, Bruno
and
Hordijk, Arie
2000.
Balanced sequences and optimal routing.
Journal of the ACM,
Vol. 47,
Issue. 4,
p.
752.
Altman, Eitan
2002.
Handbook of Markov Decision Processes.
Vol. 40,
Issue. ,
p.
489.
van der Laan, Dinard
2005.
Routing Jobs to Servers with Deterministic Service Times.
Mathematics of Operations Research,
Vol. 30,
Issue. 1,
p.
195.
Gaujal, Bruno
Hyon, Emmanuel
and
Jean-Marie, Alain
2006.
Optimal Routing in Two Parallel Queues with Exponential Service Times.
Discrete Event Dynamic Systems,
Vol. 16,
Issue. 1,
p.
71.
Herrmann, Jeffrey W.
2012.
Using aggregation to construct periodic policies for routing jobs to parallel servers with deterministic service times.
Journal of Scheduling,
Vol. 15,
Issue. 2,
p.
181.
Hordijk, Wim
Hordijk, Arie
and
Heidergott, Bernd
2015.
A Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information.
Asia-Pacific Journal of Operational Research,
Vol. 32,
Issue. 03,
p.
1550015.
Konovalov, Mikhail
and
Razumchik, Rostislav
2018.
Improving routing decisions in parallel non-observable queues.
Computing,
Vol. 100,
Issue. 10,
p.
1059.