A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The concert/cafeteria queueing problem: a game of arrivals
2009
Proceedings of the 4th International ICST Conference on Performance Evaluation Methodologies and Tools
We introduce the concert or the cafeteria queueing problem: Fixed but a large number of users arrive into a queue which provides service starting at time 0. Users may arrive before 0. They incur a queued waiting cost α • W , where W is the time to wait in the queue until service, and service time cost β • (t + W ), where t is the arrival time and t + W is the total time until service. Each user picks a mixed strategy for arrival to minimize E[αW + β(t + W )]. We analyze the system in an
doi:10.4108/icst.valuetools2009.7624
dblp:conf/valuetools/JunejaJ09
fatcat:2sdm2sxsffdajklqlf5y27gcre