Harmony Search Approach for Patient Scheduling in Emergency Laboratories

15 pages•Published: September 29, 2016

Abstract

This paper deals with the problem of scheduling prioritized patient in emergency department laboratories according to a triage factor. The problem is considered as a flexible open shop scheduling problem with the objective of minimizing the total completion time of prioritized patients. In this research, patient scheduling is addressed with a harmony search algorithm with wheel-roulette selection technique. Then, a comparative study is performed by considering results of genetic algorithm. Simulations on real data from emergency department show that the proposed approach improves significantly the total completion time of patients especially those with severe conditions.

Keyphrases: emergency department, harmony search algorithm, healthcare management, optimization problem, prioritized patient scheduling

In: Christoph Benzmüller, Geoff Sutcliffe and Raul Rojas (editors). GCAI 2016. 2nd Global Conference on Artificial Intelligence, vol 41, pages 109-123.

Links:	https://easychair.org/publications/paper/dbLz
	https://doi.org/10.29007/jr2r

BibTeX entry

@inproceedings{GCAI2016:Harmony_Search_Approach_Patient,
  author    = {Imen Boudali and Nihel Mokhtar},
  title     = {Harmony Search Approach for Patient Scheduling in Emergency Laboratories},
  booktitle = {GCAI 2016. 2nd Global Conference on Artificial Intelligence},
  editor    = {Christoph Benzmüller and Geoff Sutcliffe and Raul Rojas},
  series    = {EPiC Series in Computing},
  volume    = {41},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/dbLz},
  doi       = {10.29007/jr2r},
  pages     = {109-123},
  year      = {2016}}

Download PDF Open PDF in browser