First in line waiting times as a tool for analysing queueing systems
DOI10.1287/OPRE.1120.1089zbMATH Open1257.90015OpenAlexW2011316445MaRDI QIDQ4904589FDOQ4904589
T. B. Nielsen, G. M. Koole, Bo Friis Nielsen
Publication date: 30 January 2013
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/588d248b8143e2f003d5e8cd4b280410a1a06463
Recommendations
due datewaiting time distributiondynamic prioritycall centersErlang distributionpriority queuesdeterministic threshold
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Queues and service in operations research (90B22)
Cited In (11)
- A first passage time problem for spectrally positive Lévy processes and its application to a dynamic priority queue
- A Uniformization Approach for the Dynamic Control of Queueing Systems with Abandonments
- A fast staffing algorithm for multistage call centers with impatient customers and time-dependent overflow
- Call centers with a postponed callback offer
- Unintended consequences of optimizing a queue discipline for a service level defined by a percentile of the waiting time
- Late-rejection, a strategy to perform an overflow policy
- Waiting time based routing policies to parallel queues with percentiles objectives
- Age-based Markovian approximation of the G/M/1 queue
- Transient analysis of a Markovian queue with deterministic rejection
- OPTIMIZATION OF OVERFLOW POLICIES IN CALL CENTERS
- Title not available (Why is that?)
This page was built for publication: First in line waiting times as a tool for analysing queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904589)