Name
Abstract | ||
|---|---|---|
We consider the online problem of scheduling patients with urgencies and preferences on hospital resources with limited capacity. To solve this complex scheduling problem effectively we have to address the following sub problems: determining the allocation of capacity to patient groups, setting dynamic rules for exceptions to the allocation, ordering timeslots based on scheduling efficiency, and incorporating patient preferences over appointment times in the scheduling process. We present a scheduling approach with optimized parameter values that solves these issues simultaneously. In our experiments, we show how our approach outperforms standard scheduling benchmarks for a wide range of scenarios, and how we can efficiently trade-off scheduling performance and fulfilling patient preferences. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02976-9_9 | AIME '87 |
Keywords | Field | DocType |
limited capacity,patient group,trade-off scheduling performance,scheduling approach,patient preference,online patient scheduling,following sub problem,online problem,complex scheduling problem,standard scheduling benchmarks,scheduling process,scheduling problem | Computer science,Two-level scheduling,Artificial intelligence,Rate-monotonic scheduling,Distributed computing,Fixed-priority pre-emptive scheduling,Fair-share scheduling,Deadline-monotonic scheduling,Operations research,Dynamic priority scheduling,Earliest deadline first scheduling,Machine learning,Round-robin scheduling | Conference |
Volume | ISSN | Citations |
5651 | 0302-9743 | 3 |
PageRank | References | Authors |
0.42 | 8 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| I. B. Vermeulen | 1 | 6 | 0.92 |
| S. M. Bohte | 2 | 120 | 10.02 |
| P. A. Bosman | 3 | 3 | 0.42 |
| S. G. Elkhuizen | 4 | 6 | 0.92 |
| Piet J. Bakker | 5 | 177 | 13.43 |
| Johannes A. La Poutré | 6 | 308 | 24.78 |