Name
Abstract | ||
|---|---|---|
We consider an appointment system where the patients have preferences about the appointment days. A patient may be scheduled on one of the days that is acceptable to her, or be denied appointment. The patient may or may not show up at the appointed time. The net cost is a convex function of the actual number of patients served on a given day. We study the optimal scheduling policy that minimizes the long-run average cost and study its structural properties. We advocate an index policy, which is easy to implement, performs well in comparison with other heuristic policies, and is close to the optimal policy. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s11134-016-9506-x | Queueing Syst. |
Keywords | Field | DocType |
Markov Decision Processes,Index policies,Appointment scheduling,Patient preferences,60J05,90B22 | Heuristic,Mathematical optimization,Scheduling (computing),Markov decision process,Average cost,Real-time computing,Convex function,Mathematics | Journal |
Volume | Issue | ISSN |
85 | 1-2 | 0257-0130 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Zhang | 1 | 0 | 0.34 |
| Vidyadhar G. Kulkarni | 2 | 539 | 60.15 |