2 citations · 2 across the 1 of their papers we have counts for
3 papers
cs.LG2022★ 2 cited
Can machines solve general queueing systems?
Eliran Sherzer, Arik Senderovich, Opher Baron +1
In this paper, we analyze how well a machine can solve a general problem in queueing theory. To answer this question, we use a deep learning model to predict the stationary queue-l…
math.OC2017
When to arrive at a queue with earliness, tardiness and waiting costs
Eliran Sherzer, Yoav Kerner
We consider a queueing facility where customers decide when to arrive. All customers have the same desired arrival time (w.l.o.g.\ time zero). There is one server, and the service…
math.PR2017
Customers' abandonment strategy in an M/G/1 queue
Eliran Sherzer, Yoav Kerner
We consider an M/G/1 queue in which the customers, while waiting in line, may renege from it. We study the Nash equilibrium profile among customers, and show that it is defined by…