BIRS workshop: Canadian Queueing Theorists and Practitioners Conference

External homepage


Banff International Research Station

Audience: Researchers in the topic
Conference dates: 21-Aug-2020 to 22-Aug-2020
Curator: BIRS Programme Coordinator*
*contact for this listing

Queueing theory is concerned with developing and investigating mathematical models of systems where “customers” wait for “service.” The terms “customers” and “servers” are generic. Customers could, for example, be humans waiting in a physical line or waiting on hold on the telephone, jobs waiting to be processed in a factory, or tasks waiting for processing in a computer or communication system.

The CanQueue annual conference started from a workshop, organized by Prof. Alfa, at the University of Manitoba in 1999. Since then, twenty (20) CanQueue conferences have been held in Canada, including CanQueue 2002 at U of S; 2004 at UBC Okanagan, 2006 and 2011 at Banff, both sponsored by BIRS. It was a decision at the CanQueue2019, at Fields Institute in Toronto in August 2019 that CanQueue 2020 will be organized by us and held at Banff (based on the feedback from Canadian queueing community people).

Queueing theory started with the work of Danish mathematician A. K. Erlang in 1905, which was motivated by the problem of designing telephone exchanges. The field has grown to include the application of a variety of mathematical methods to the study of waiting lines in many different contexts. The mathematical methods include Markov processes, linear algebra, transform theory, and asymptotic methods, to name a few. The areas of application include computer and communication systems, manufacturing systems, and health care systems. Many recent developments in queueing theory have been driven in large part by a greater interest in applications that involve human customers, for example in the rapidly growing call centre sector. Humans behave in less predictable ways than, say, jobs in a factory or tasks in a computer system. For example, they may renege (abandon the queue), and retry later. The needs of human customers are likely to be heterogeneous (motivating the use of skills-based routing to connect different customers to different servers) and to vary with time (sometimes requiring transient rather than steady-state solutions).

All of these complications lead to interesting mathematical challenges. The interest in modeling reneging has led to a substantial literature by now, for example. Asymptotic analysis, which in the past typically considered situations where the arrival rate approached the capacity of a system with fixed number of servers, has been rejuvenated by a focus on situations where the arrival rate and the number of servers approach infinity simultaneously. Such many-server asymptotic analysis has resulted in a collection of simple-to-use formulas for recommended staffing, consisting of a linear term (minimum staffing for stability) and a square root term (“safety staffing,” to protect against random fluctuations). In addition to the focus on the call centre sector, applications in health care are becoming increasingly important.

Upcoming talks
Past talks
Your timeSpeakerTitle
SatAug 2219:00Ahmed Sid AliFluid model for multiple TCP and UDP connections through a network of queues in a random environment
SatAug 2218:30Katsunobu SasanumaQueueing and Markov chain decomposition method to analyze Markov-modulated Markov chains
SatAug 2218:00Na LiA decision integration strategy for short-term demand forecasting and ordering for red blood cell components
SatAug 2217:30George ZhangPerformance Analysis of a Markovian Queue with Service Rate and Customers' Joining Decisions
SatAug 2217:00Vera TilsonModels of the Impact of Triage Nurse Standing Orders on Emergency Department Length of Stay
SatAug 2216:00Ruichao JiangAn upper bound for the Galois group of weight walks with rational coefficients in the quarter plane
SatAug 2215:30Javad TavakoliThe Distribution of the Line Length in a GI/G/1 Queue Using Distribution Little Laws and Roots Methods
SatAug 2214:30Winfried GrassmannQueueing Theory in a World where most Queueing Problems are Solved by Simulation
FriAug 2122:00Peter TaylorAdmission Policies for Complex Resource Allocation Problems
FriAug 2121:00Douglas DownSize-based Scheduling with Estimation Errors
FriAug 2120:30Amir RastpourAlgorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes
FriAug 2120:00Myron HlynkaCompleting a Task with Interruptions
FriAug 2118:00Suman ThapaConstruction of New Copulas with Applications to Queueing Models
FriAug 2116:30Barbara MargoliusCatastrophes and Queueing Systems with Time-Varying Periodic Transition Rates
FriAug 2116:00Qi-Ming HeBounds on the Mean and Squared Coefficient of Variation of Phase-Type Distributions
FriAug 2115:30Haoran WuDouble-Sided Queues with Marked Markovian Arrival Processes and Abandonment
Embed this schedule
Export series to