论文信息 - Who should be given priority in a queue?

Who should be given priority in a queue?

We consider a memoryless single server queue with two classes of customers, each having its fixed entry fee. We show that profit and social welfare may benefit from a service discipline based on relative priorities.

Refael Hassin | Moshe Haviv

[1] Haim Mendelson,et al. Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue , 1990, Oper. Res..

[2] G. J. A. Stern,et al. Queueing Systems, Volume 2: Computer Applications , 1976 .

[3] Kashi R. Balachandran,et al. Class Dominance Characteristics at a Service Facility , 1979 .

[4] Refael Hassin,et al. To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems , 2002 .

[5] D. K. Hildebrand,et al. Congestion Tolls for Poisson Queuing Processes , 1975 .

[6] Kiran M. Rege,et al. A decomposition theorem and related results for the discriminatory processor sharing queue , 1994, Queueing Syst. Theory Appl..

[7] Isi Mitrani,et al. Sharing a Processor Among Many Job Classes , 1980, JACM.

[8] Eitan Altman,et al. DPS queues with stationary ergodic service times and the performance of TCP in overload , 2004, IEEE INFOCOM 2004.

[9] Yezekael Hayel,et al. Pricing for Heterogeneous Services at a Discriminatory Processor Sharing Queue , 2005, NETWORKING.

[10] Laurent Massoulié,et al. Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[11] Moshe Haviv,et al. Waiting times in queues with relative priorities , 2007, Oper. Res. Lett..

[12] S. Wittevrongel,et al. Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.