Name
Abstract | ||
|---|---|---|
•We derive solutions for appointment scheduling with routine and urgent patients with no-show.•For deterministic service time, an exact method is proposed to find the optimal schedule.•For exponentially service time, a property is presented to show the objective is not multimodular.•A heuristic algorithm based on shifting policies is developed to give an upper bound.•Experiments are conducted to illustrate how the critical factors affect service efficiency. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.eswa.2014.01.014 | Expert Systems with Applications |
Keywords | Field | DocType |
Appointment scheduling system,Health care operation management,Heuristics,Multimodularity,Two types of patients | Data mining,Mathematical optimization,Scheduling (computing),Upper and lower bounds,Heuristic (computer science),Computer science,Real-time computing,Heuristics,Exponential distribution,Overtime,Local search (optimization),Global optimality | Journal |
Volume | Issue | ISSN |
41 | 10 | 0957-4174 |
Citations | PageRank | References |
5 | 0.45 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiafu Tang | 1 | 541 | 49.29 |
| Chongjun Yan | 2 | 15 | 1.29 |
| Pingping Cao | 3 | 5 | 0.45 |