Queueing models for appointment-driven systems

Many service systems are appointment-driven. In such systems, customers make an appointment and join an external queue (also referred to as the “waiting list”). At the appointed date, the customer arrives at the service facility, joins an internal queue and receives service during a service session. After service, the customer leaves the system. Important measures of interest include the size of the waiting list, the waiting time at the service facility and server overtime. These performance measures may support strategic decision making concerning server capacity (e.g. how often, when and for how long should a server be online). We develop a new model to assess these performance measures. The model is a combination of a vacation queueing system and an appointment system.

[1]  Elliott N. Weiss,et al.  Models for Determining Estimated Start Times and Case Orderings In Hospital Operating Rooms , 1990 .

[2]  M. H. Quenouille,et al.  Mathematical Methods in the Theory of Queueing , 1962, Mathematical Gazette.

[3]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[4]  Dieter Fiems.  Analysis of discrete-time queueing systems with vacations , 2004 .

[5]  Hideaki Takagi,et al.  Queuing analysis of polling models , 1988, CSUR.

[6]  Aleksandr I︠A︡kovlevich Khinchin,et al.  Mathematical methods in the theory of queueing , 1969 .

[7]  Naishuo Tian,et al.  Vacation Queueing Models Theory and Applications , 2006 .

[8]  Kin K. Leung,et al.  A single-server queue with vacations and gated time-limited service , 1990, IEEE Trans. Commun..

[9]  Tsuyoshi Katayama.  Waiting time analysis for a queueing system with time-limited service and exponential timer , 2001 .

[10]  Emre A. Veral,et al.  OUTPATIENT SCHEDULING IN HEALTH CARE: A REVIEW OF LITERATURE , 2003 .

[11]  C. Dennis Pegden,et al.  PLANNING TIMELY ARRIVALS TO A STOCHASTIC PRODUCTION OR SERVICE SYSTEM , 1988 .

[12]  Hon-Shiang Lau,et al.  Minimizing total cost in scheduling outpatient appointments , 1992 .

[13]  Izhak Rubin,et al.  Analysis of an M/G/1/N queue with vacations and its iterative application to FDDI timed-token rings , 1995, TNET.

[14]  H. Takagi.  Analysis of finite-capacity polling systems , 1991, Advances in Applied Probability.

[15]  E. Dudewicz,et al.  Modern Mathematical Statistics. , 1990 .

[16]  H. Tijms.  A First Course in Stochastic Models , 2003 .

[17]  Pu Patrick Wang,et al.  A vacation queueing model with service breakdowns , 2000 .

[18]  Yang Woo Shin,et al.  The BMAP/G/1 vacation queue with queue-length dependent vacation schedule , 1998, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.

[19]  P. Patrick Wang,et al.  Optimally scheduling N customer arrival times for a single-server system , 1997, Comput. Oper. Res..

[20]  Zhisheng Niu,et al.  A vacation queue with setup and close-down times and batch Markovian arrival processes , 2003, Perform. Evaluation.

[21]  Naishuo Tian,et al.  Vacation Queueing Models , 2006 .

[22]  Vaidyanathan Ramaswami,et al.  Introduction to Matrix Analytic Methods in Stochastic Modeling , 1999, ASA-SIAM Series on Statistics and Applied Mathematics.

[23]  Hideaki Takagi,et al.  M/G/1//N Queues with Server Vacations and Exhaustive Service , 1994, Oper. Res..

[24]  Shaler Stidham,et al.  Analysis, Design, and Control of Queueing Systems , 2002, Oper. Res..

[25]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

[26]  T. DoshiB..  Queueing systems with vacationsa survey , 1986 .

[27]  Marc Lambrecht,et al.  Modeling a Healthcare System as a Queueing Network: The Case of a Belgian Hospital , 2007 .

[28]  B. T. Doshi,et al.  Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

[29]  Dennis C. Dietz,et al.  Minimizing expected waiting in a medical appointment system , 2000 .

[30]  Tsuyoshi Katayama,et al.  Sojourn time analysis of a two-phase queueing system with exhaustive batch-service and its vacation model , 2003 .

[31]  Sem C. Borst,et al.  The use of service limits for efficient operation of multistation single-medium communication systems , 1995, TNET.

[32]  Hon-Shiang Lau,et al.  Evaluating the impact of operating conditions on the performance of appointment scheduling rules in service systems , 1999, Eur. J. Oper. Res..

[33]  B. Meini,et al.  Structured Markov chains solver: software tools , 2006, SMCtools '06.

[34]  G. Bitran,et al.  Approximations for networks of queues with overtime , 1991 .

[35]  Susana V. Mondschein,et al.  APPOINTMENT POLICIES IN SERVICE OPERATIONS: A CRITICAL ANALYSIS OF THE ECONOMIC FRAMEWORK , 2003 .

[36]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[37]  S. Steffé,et al.  Structured Markov chains solver: algorithms , 2006, SMCtools '06.

[38]  Alma Riska,et al.  Aggregate matrix-analytic techniques and their applications , 2002 .

[39]  Peter M. Vanden Bosch,et al.  Scheduling and Sequencing Arrivals to an Appointment System , 2001 .

[40]  Jan A. Van Mieghem,et al.  Strategically Seeking Service: How Competition Can Generate Poisson Arrivals , 2004, Manuf. Serv. Oper. Manag..

[41]  V. M. Vishnevskii,et al.  Mathematical methods to study the polling systems , 2006 .

[42]  Nico Vandaele,et al.  Clips: a capacity and lead time integrated procedure for scheduling , 1998 .

[43]  Richard R. Muntz,et al.  Polling systems with server timeouts and their application to token passing networks , 1995, TNET.

[44]  Mor Harchol-Balter,et al.  Analysis of multi-server systems via dimensionality reduction of markov chains , 2005 .