Accurate and efficient approximation of large-scale appointment schedules

DOI10.1080/15326349.2025.2455750MaRDI QIDQ6911389zbMATH OpenFDO

Authors R. Bekker, Bharti Bharti, M. R. H. Mandjes

Publication date 24 October 2025

Published in Stochastic Models (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1080/15326349.2025.2455750

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Cites work

• A computational approach to optimized appointment scheduling
• A Moment-Iteration Method for Approximating the Waiting-Time Characteristics of the GI/G/1 Queue
• A queueing-based approach for integrated routing and appointment scheduling
• Adaptive appointment scheduling with periodic updates
• Applied Probability and Queues
• Approximations for the conditional waiting times in the GI/G/c queue
• Control of a continuous production inventory system with production quantity restrictions
• Home service routing and appointment scheduling with stochastic service times
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 221926 (Why is no real title available?)
• scientific article; zbMATH DE number 3072483 (Why is no real title available?)
• Minimizing Total Cost in Scheduling Outpatient Appointments
• Numerical Inversion of Laplace Transforms of Probability Distributions
• Optimal sequencing using a scheduling heuristic
• Optimal stationary appointment schedules
• Optimally scheduling \(N\) customer arrival times for a single-server system
• Outpatient appointment systems in healthcare: a review of optimization studies
• Performance of the smallest-variance-first rule in appointment sequencing
• Scheduling Arrivals to Queues: A Single-Server Model with No-Shows
• Stochastic simulation: Algorithms and analysis
• Wiener-Hopf Factorization for Lévy Processes Having Positive Jumps with Rational Transforms

Cited in

(1)

• Appointment scheduling for parallel queues

This page was built for publication: Accurate and efficient approximation of large-scale appointment schedules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6911389)