Abstract
We present a dynamic and distributed approach to the hospital patient scheduling problem, in which patients can have multiple appointments that have to be scheduled to different resources. To efficiently solve this problem we develop a multi-agent Pareto-improvement appointment exchanging algorithm: MPAEX. It respects the decentralization of scheduling authorities and continuously improves patient schedules in response to the dynamic environment. We present models of the hospital patient scheduling problem in terms of the health care cycle where a doctor repeatedly orders sets of activities to diagnose and/or treat a patient. We introduce the Theil index to the health care domain to characterize different hospital patient scheduling problems in terms of the degree of relative workload inequality between required resources. In experiments that simulate a broad range of hospital patient scheduling problems, we extensively compare the performance of MPAEX to a set of scheduling benchmarks. The distributed and dynamic MPAEX performs almost as good as the best centralized and static scheduling heuristic, and is robust for variations in the model settings.
Article PDF
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Avoid common mistakes on your manuscript.
References
Vermeulen I, Bohte S, Somefun K, La Poutré H (2007) Improving patient activity schedules by multi-agent pareto appointment exchanging. In: Proceedings of the IEEE international conference on E-commerce technology, CEC/EEE, pp 56–63
Vissers JM (1998). Patient flow-based allocation of inpatient resources: a case study. Eur J Oper Res 105: 356–370
Marinagi C, Spyropoulos CD, Papatheodorou C and Kokkotos S (2000). Continual planning and scheduling for managing patient tests in hospital laboratories. Artif Intell Med 20(2): 139–154
Spyropoulos CD (2000). Ai planning and scheduling in the medical hospital environment. Artif Intell Med 20(2): 101–111
Paulussen TO, Jennings NR, Decker K, Heinzl A (2003) Distributed patient scheduling in hospitals. In: Proceedings 18th international joint conference on AI
Nealon J, Moreno A (2003) Agent-based applications in health care. In: Nealon J, Moreno A (eds) Applications of software agent technology in the health care domain. Birkhueser, pp 3–18
(1999). Multiagent systems: a modern approach to distributed artificial intelligence. MIT Press, Cambridge MA
Decker K and Li J (2000). Coordinating mutually exclusive resources using gpgp. Auton Agent Multi Agent Syst 3(2): 133–157
Hannebauer M, Müller S (2001) Distributed constraint optimization for medical appointment scheduling. In: AGENTS ’01: Proceedings of the fifth international conference on autonomous agents, ACM Press, New York, pp 139–140
Wellman M, Walsh W, Wurman P and MacKie-Mason J (2001). Auction protocols for decentralized scheduling. Games Econ Behav 35: 271–303
Reeves DM, Wellman MP, MacKie-Mason JK and Osepayshvili A (2005). Exploring bidding strategies for market-based scheduling. Decis Support Syst 39(1): 67–85
Sen S and Durfee E (1996). A contracting model for flexible distributed scheduling. Ann Oper Res 65: 195–222
Czap H, Becker M (2003) Multi-agent systems and microeconomic theory: a negotiation approach to solve scheduling problems in high dynamic environments. In: Proceedings of 36th annual Hawaii international conference on system sciences, pp 83
Maruster L, Weijters T, Daelemans W, Vries G and Bosch A (2002). Logistic-based patient grou** for multi-disciplinary treatment. Artificial Intelligence Med 26(1-2): 87–107
Mas-Colell A, Whinston M and Green JR (1995). Microeconomic theory. Oxford University Press, Oxford
Chevaleyre Y, Dunne PE, Endriss U, Lang J, tre ML, Maudet N, Padget J, Phelps S, guez Aguilar JAR and Sousa P (2006). Issues in multiagent resource allocation. Informatica 30: 3–31
Endriss U, Maudet N, Sadri F and Toni F (2006). Negotiating socially optimal allocations of resources. J Artif Intell Res 25: 315–348
Theil H (1967). Economics and information theory. North-Holland, Amsterdam
Sgall J (1996). On-line scheduling. In: Fiat A, Woeginger GJ (eds). Online algorithms. Springer, Berlin, 196–231
Brucker P (2001). Scheduling algorithms. Springer, Berlin
Land AH and Doig AG (1960). An automatic method for solving discrete programming problems. Econometrica 28: 497–520
Aarts E and Lenstra J (2003). Local Search in Combinatorial Optimization. Princeton University Press, NJ
Haupt R (1989). A survey of priority rule-based scheduling. OR Spect 11(1): 3–16
Porter ME and Teisberg EO (2004). Redefining competition in health care. Harv Bus Rev 82: 64–76
Hoogeveen H, Schuurman P, Woeginger GJ (1998) Non- approximability results for scheduling problems with minsum criteria. In: Proceedings 6th international integer programming and combinatorial optimization conference. Lecture notes in computer science, vol 1412. Springer, Berlin, pp 353–366
Vermeulen I, Bohte S, Elkhuizen S, Lameris J, Bakker P, La Poutré H (2007) Adaptive optimization of hospital resource calendars. In: Proceedings of the 11th conference on artificial intelligence in medicine, AIME 07. Lecture notes in computer science. Springer, Berlin
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this work has appeared as [1].
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License ( https://creativecommons.org/licenses/by-nc/2.0 ), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Vermeulen, I., Bohte, S., Somefun, K. et al. Multi-agent Pareto appointment exchanging in hospital patient scheduling. SOCA 1, 185–196 (2007). https://doi.org/10.1007/s11761-007-0012-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11761-007-0012-1