Improving patient activity schedules by multi-agent pareto appointment exchanging

I. Vermeulen; D.J.A. Somefun; S.M. Bohté; J.A. Poutré, la

doi:10.1109/CEC-EEE.2006.55

Improving patient activity schedules by multi-agent pareto appointment exchanging

I. Vermeulen, D.J.A. Somefun, S.M. Bohté, J.A. Poutré, la

Information Systems IE&IS

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

15 Citations (Scopus)

Abstract

We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects the decentralization of scheduling authorities and is capable of continuously adjusting the different 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 (partial plans) 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 stylized hospital patient scheduling problems, we extensively compare the performance of MPAEX to a set of heuristics. The distributed and dynamic MPAEX has performances almost as good as the best centralized and static scheduling heuristics.

Original language	English
Title of host publication	E-Commerce Technology, 2006. The 8th IEEE International Conference on and Enterprise Computing, E-Commerce, and E-Services, The 3rd IEEE International Conference on
Publisher	IEEE Press
Pages	9-9
DOIs	https://doi.org/10.1109/CEC-EEE.2006.55
Publication status	Published - 2006

Access to Document

10.1109/CEC-EEE.2006.55

Cite this

Vermeulen, I., Somefun, D. J. A., Bohté, S. M., & Poutré, la, J. A. (2006). Improving patient activity schedules by multi-agent pareto appointment exchanging. In E-Commerce Technology, 2006. The 8th IEEE International Conference on and Enterprise Computing, E-Commerce, and E-Services, The 3rd IEEE International Conference on (pp. 9-9). IEEE Press. https://doi.org/10.1109/CEC-EEE.2006.55

@inproceedings{cbc76e36e3d6449fa370a61e4f92ba1f,

title = "Improving patient activity schedules by multi-agent pareto appointment exchanging",

abstract = "We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects the decentralization of scheduling authorities and is capable of continuously adjusting the different 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 (partial plans) 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 stylized hospital patient scheduling problems, we extensively compare the performance of MPAEX to a set of heuristics. The distributed and dynamic MPAEX has performances almost as good as the best centralized and static scheduling heuristics.",

author = "I. Vermeulen and D.J.A. Somefun and S.M. Boht{\'e} and {Poutr{\'e}, la}, J.A.",

year = "2006",

doi = "10.1109/CEC-EEE.2006.55",

language = "English",

pages = "9--9",

booktitle = "E-Commerce Technology, 2006. The 8th IEEE International Conference on and Enterprise Computing, E-Commerce, and E-Services, The 3rd IEEE International Conference on",

publisher = "IEEE Press",

}

Vermeulen, I, Somefun, DJA, Bohté, SM & Poutré, la, JA 2006, Improving patient activity schedules by multi-agent pareto appointment exchanging. in E-Commerce Technology, 2006. The 8th IEEE International Conference on and Enterprise Computing, E-Commerce, and E-Services, The 3rd IEEE International Conference on. IEEE Press, pp. 9-9. https://doi.org/10.1109/CEC-EEE.2006.55

Improving patient activity schedules by multi-agent pareto appointment exchanging. / Vermeulen, I.; Somefun, D.J.A.; Bohté, S.M. et al.

E-Commerce Technology, 2006. The 8th IEEE International Conference on and Enterprise Computing, E-Commerce, and E-Services, The 3rd IEEE International Conference on. IEEE Press, 2006. p. 9-9.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Improving patient activity schedules by multi-agent pareto appointment exchanging

AU - Vermeulen, I.

AU - Somefun, D.J.A.

AU - Bohté, S.M.

AU - Poutré, la, J.A.

PY - 2006

Y1 - 2006

N2 - We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects the decentralization of scheduling authorities and is capable of continuously adjusting the different 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 (partial plans) 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 stylized hospital patient scheduling problems, we extensively compare the performance of MPAEX to a set of heuristics. The distributed and dynamic MPAEX has performances almost as good as the best centralized and static scheduling heuristics.

AB - We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects the decentralization of scheduling authorities and is capable of continuously adjusting the different 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 (partial plans) 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 stylized hospital patient scheduling problems, we extensively compare the performance of MPAEX to a set of heuristics. The distributed and dynamic MPAEX has performances almost as good as the best centralized and static scheduling heuristics.

U2 - 10.1109/CEC-EEE.2006.55

DO - 10.1109/CEC-EEE.2006.55

M3 - Conference contribution

SP - 9

EP - 9

BT - E-Commerce Technology, 2006. The 8th IEEE International Conference on and Enterprise Computing, E-Commerce, and E-Services, The 3rd IEEE International Conference on

PB - IEEE Press

ER -

Improving patient activity schedules by multi-agent pareto appointment exchanging

Abstract

Access to Document

Fingerprint

Cite this