Adaptive scheduling in service systems: a dynamic programming approach
From MaRDI portal
Cites work
- A computational approach to optimized appointment scheduling
- Applied Probability and Queues
- Appointment scheduling with discrete random durations
- Appointment sequencing: why the smallest-variance-first rule may not be optimal
- Computationally efficient evaluation of appointment schedules in health care
- Home service routing and appointment scheduling with stochastic service times
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- scientific article; zbMATH DE number 1183924 (Why is no real title available?)
- scientific article; zbMATH DE number 221926 (Why is no real title available?)
- scientific article; zbMATH DE number 805121 (Why is no real title available?)
- Optimal booking and scheduling in outpatient procedure centers
- Optimal stationary appointment schedules
- Optimally scheduling \(N\) customer arrival times for a single-server system
- Optimized appointment scheduling
- Outpatient scheduling with unpunctual patients and no-shows
- Performance of the smallest-variance-first rule in appointment sequencing
- Scheduling arrivals to queues
- Scheduling Arrivals to Queues: A Single-Server Model with No-Shows
- Stochastic optimization models for a home service routing and appointment scheduling problem with random travel and service times
Cited in
(2)
This page was built for publication: Adaptive scheduling in service systems: a dynamic programming approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090162)