The optimal allocation of server time slots over different classes of patients

DOI10.1016/j.ejor.2011.10.045zbMath1253.90073OpenAlexW3125152337MaRDI QIDQ1926665

Stefan Creemers, Jeroen Beliën, Marc R. Lambrecht

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.10.045

zbMATH Keywords

Markov processesOR in health servicesoptimal capacity allocationbulk service queuepatient waiting time

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Case-oriented studies in operations research (90B90)

Related Items (10)

Computationally efficient evaluation of appointment schedules in health care ⋮ Optimal appointment scheduling in continuous time: the lag order approximation method ⋮ Scheduling operating rooms: achievements, challenges and pitfalls ⋮ Outpatient scheduling with unpunctual patients and no-shows ⋮ Operating room planning and surgical case scheduling: a review of literature ⋮ Outpatient appointment systems in healthcare: a review of optimization studies ⋮ Analysis of a discrete-time queue with general independent arrivals, general service demands and fixed service capacity ⋮ Capacity planning with demand uncertainty for outpatient clinics ⋮ Analysis of models for the stochastic outpatient procedure scheduling problem ⋮ A multi-objective combinatorial model of casualty processing in major incident response

Uses Software

• MCQueue
• SMCSolver

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Queueing models for appointment-driven systems
• An advanced queueing model to analyze appointment-driven service systems
• Operating room planning and scheduling: a literature review
• Queueing systems with vacations - a survey
• Performance analysis of finite buffer discrete-time queue with bulk service
• A finite capacity bulk service queue with single vacation and Markovian arrival process
• Vacation queueing models. Theory and applications
• Analytic computation schemes for the discrete-time bulk service queue
• Finite-Buffer Bulk Service Queue Under Markovian Service Process:GI/MSP^(a,b)/1/N
• A stable recursion for the steady state vector in markov chains of m/g/1 type
• Queuing analysis of polling models
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains
• Analysis of a finite-buffer bulk-service queue with discrete-Markovian arrival process: D-MAP/Ga,b/1/N

This page was built for publication: The optimal allocation of server time slots over different classes of patients