Performance of the Smallest-Variance-First Rule in Appointment Sequencing

DOI10.1287/opre.2020.2025zbMath1482.90090arXiv1812.01467OpenAlexW3124064250MaRDI QIDQ5031672

Madelon A. de Kemp, Neil Olver, M. R. H. Mandjes

Publication date: 16 February 2022

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.01467

zbMATH Keywords

approximation algorithmsappointment scheduling and sequencing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Optimal sequencing using a scheduling heuristic ⋮ Adaptive scheduling in service systems: a dynamic programming approach ⋮ Sequencing in an appointment system with deterministic arrivals and non-identical exponential service times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimized appointment scheduling
• Optimal booking and scheduling in outpatient procedure centers
• Stochastic orders
• Outpatient appointment systems in healthcare: a review of optimization studies
• Appointment sequencing: why the smallest-variance-first rule may not be optimal
• A computational approach to optimized appointment scheduling
• Stochastic online scheduling on unrelated machines
• Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones
• Appointment Scheduling with Discrete Random Durations
• Robust Appointment Scheduling
• Unrelated Machine Scheduling with Stochastic Processing Times
• On the Departure from Normality of a Certain Class of Martingales
• Some inequalities for the queue GI/G/1
• Scheduling