Sequencing in an appointment system with deterministic arrivals and non-identical exponential service times
DOI10.1016/J.COR.2020.104901zbMATH Open1458.90207OpenAlexW3003654979WikidataQ115578051 ScholiaQ115578051MaRDI QIDQ2297583FDOQ2297583
Sangdo Choi, Wilbert E. Wilhelm
Publication date: 20 February 2020
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.104901
Recommendations
- Appointment sequencing: why the smallest-variance-first rule may not be optimal
- Performance of the smallest-variance-first rule in appointment sequencing
- Optimized appointment scheduling
- Appointment scheduling for multi-stage sequential service systems with stochastic service durations
- A computational approach to optimized appointment scheduling
appointment schedulingexponential service timesdeterministic arrival timessmallest-mean-first-rulesmallest-variance-first-rule
Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Introduction to Stochastic Programming
- Optimally scheduling \(N\) customer arrival times for a single-server system
- Sequencing and scheduling \(N\) customers for a stochastic server
- An elective surgery scheduling problem considering patient priority
- Planning and Scheduling in Manufacturing and Services
- Optimal booking and scheduling in outpatient procedure centers
- Choosing a Good Appointment System—A Study of Queues of the Type (D, M, 1)
- Title not available (Why is that?)
- Appointment sequencing: why the smallest-variance-first rule may not be optimal
- Performance of the Smallest-Variance-First Rule in Appointment Sequencing
Cited In (5)
- Appointment scheduling with a quantile objective
- Managing interruptions in appointment schedules via patient notification
- Optimal sequencing using a scheduling heuristic
- Appointment scheduling for multi-stage sequential service systems with limited distributional information
- A Sequence of Servers with Arbitrary Input and Regular Service Times Revisited
This page was built for publication: Sequencing in an appointment system with deterministic arrivals and non-identical exponential service times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297583)
