A queueing-based approach for integrated routing and appointment scheduling

DOI10.1016/J.EJOR.2024.05.038MaRDI QIDQ6982826zbMATH OpenFDO

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

Publication date 16 May 2025

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

Full work available at URL https://doi.org/10.1016/J.EJOR.2024.05.038

zbMATH Keywords

appointment schedulingheavy-trafficlarge neighborhood searchqueueingrouting

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35)

Cites work

• A branch-and-cut algorithm for the time window assignment vehicle routing problem
• A computational approach to optimized appointment scheduling
• A unified framework for stochastic optimization
• Applied Probability and Queues
• Dynamic shortest path problems: hybrid routing policies considering network disruptions
• Handbook of metaheuristics
• Home service routing and appointment scheduling with stochastic service times
• scientific article; zbMATH DE number 2121076 (Why is no real title available?)
• Minimizing Total Cost in Scheduling Outpatient Appointments
• New optimization heuristics. The great deluge algorithm and the record- to-record travel
• 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
• Robust vehicle routing problem with hard time windows under demand and travel time uncertainty
• Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times
• The sample average approximation method for stochastic discrete optimization
• Vehicle routing and appointment scheduling with team assignment for home services

Cited in

(1)

• Accurate and efficient approximation of large-scale appointment schedules

This page was built for publication: A queueing-based approach for integrated routing and appointment scheduling

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