, Volume 27, Issue 1, pp 24–27 | Cite as

Comments on: recent developments in the queueing problem

  • René van den BrinkEmail author

This survey gives an excellent overview on recent developments in queueing problems. It discusses part of normative as well as strategic approaches. There is a large literature on queueing problems nowadays, and it is very useful to have a structured and well organized survey, such as the one by Chun et al. (2019).

The survey considers queueing problems that consist of a set of agents/jobs that have to be served on one single machine. The machine can only serve one job at a time, and therefore jobs that are not yet served have to wait. Each agent is characterized by a unit waiting cost parameter. It is well known that an efficient (i.e. total cost minimizing) queue is one where the agents are served in nonincreasing order of waiting cost. A (allocation) ruleassigns to every queueing problem an allocation of the total waiting cost over the agents, meaning that it assigns every job to a position in the queue and determines monetary transfers. Typically, jobs that are in the front of...



  1. Chun Y, Mitra M, Mutuswami S (2019) Recent developments in the queueing problem (forthcoming in TOP) Google Scholar
  2. Curiel I, Pederzoli G, Tijs SH (1989) Sequencing games. Eur J Oper Res 40:344–351CrossRefGoogle Scholar
  3. Myerson RB (1977) Graphs and cooperation in games. Math Oper Res 2:225–229CrossRefGoogle Scholar
  4. van den Brink R, van der Laan G, Vasilev V (2007) Component efficient solutions in line-graph games with applications. Econ Theory 33:349–364CrossRefGoogle Scholar
  5. Vasilev VA (1982) On a class of operators in a space of regular set functions. Optimizacija 28:102–111 (in Russian)Google Scholar

Copyright information

© Sociedad de Estadística e Investigación Operativa 2019

Authors and Affiliations

  1. 1.Department of Econometrics and Operations Research, and Tinbergen InstituteVU University AmsterdamAmsterdamThe Netherlands

Personalised recommendations