Appointment scheduling for parallel queues

DOI10.1007/S11009-025-10213-2MaRDI QIDQ6869318zbMATH OpenFDO

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

Publication date 22 January 2026

Published in Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11009-025-10213-2

zbMATH Keywords

appointment schedulingphase-type approximationqueueingtwo-moment fit

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
• Accurate and efficient approximation of large-scale appointment schedules
• Adaptive scheduling in service systems: a dynamic programming approach
• Applied Probability and Queues
• Control of fork-join processing networks with multiple job types and parallel shared resources
• Fork-join and redundancy systems with heavy-tailed job sizes
• scientific article; zbMATH DE number 3070150 (Why is no real title available?)
• Integer programming approaches for appointment scheduling with random no-shows and service durations
• Large fork-join queues with nearly deterministic arrival and service times
• Manufacturing flow line systems: A review of models and analytical results
• Mean sojourn times in two-queue fork-join systems: bounds and approximations
• Minimizing Total Cost in Scheduling Outpatient Appointments
• On the Stability of Redundancy Models
• 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
• Redundancy-\(\mathbf{d}\): the power of \(\mathbf{d}\) choices for redundancy
• Testing for correlation between non-negative variates
• The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
• Two Parallel Queues Created by Arrivals with Two Demands I

This page was built for publication: Appointment scheduling for parallel queues

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