Patients’ admission scheduling techniques and approaches

  • Authors

    • Zahraa Adnan Abdalkareem
    • A. Amir
    • P. EhKan
    • MA Al-Betar
  • The aspects of scheduling and optimization are quite prominent in assorted domains whereby the incoming inputs or different type of traffic is processed to the further stage. In traditional ways, there are different approaches including shortest job first, first come first serve, round robin, ranking based and many others by which the overall scoring of inputs is done. In this research manuscript, the scheduling of patients’ arrival is addressed that is directly associated with the scheduling of incoming patients to the specific ward or room where that patient is required to be admitted. This work presents assorted approaches for patients’ admission scheduling including heuristic and meta-heuristic as well as related perspectives.

  • References

    1. [1] Saremi, A., Jula, P., ElMekkawy, T. and Wang, G.G., 2015. Bi-criteria appointment scheduling of patients with heterogeneous service sequences. Expert Systems with Applications, 42(8), pp.4029-4041.

      [2] Zhang, L.M., Chang, H.Y. and Xu, R.T., 2013. The patient admission scheduling of an ophthalmic hospital using genetic algorithm. In Advanced Materials Research (Vol. 756, pp. 1423-1432). Trans Tech Publications.

      [3] Goldberg, D.E., 1994. A niched Pareto genetic algorithm for multiobjective optimization. In Proceedings of the first IEEE conference on evolutionary computation, IEEE world congress on computational intelligence (Vol. 1, pp. 82-87).

      [4] Schwiegelshohn, U. and Yahyapour, R., 1998, January. Analysis of first-come-first-serve parallel job scheduling. In SODA (Vol. 98, pp. 629-638).

      [5] Hutzschenreuter, A.K., Bosman, P.A., Blonk-Altena, I., van Aarle, J. and La Poutré, H., 2008, May. Agent-based patient admission scheduling in hospitals. In Proceedings of the Seventh international joint conference on Autonomous agents and multiagent systems: industrial track (pp. 45-52). International Foundation for Autonomous Agents and Multiagent Systems.

      [6] Faratin, P., Sierra, C. and Jennings, N.R., 1998. Negotiation decision functions for autonomous agents. Robotics and Autonomous Systems, 24(3-4), pp.159-182.

      [7] Ceschia, S. and Schaerf, A., 2012. Patient admission scheduling with operating room constraints. In Proc. of the ninth Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT-2012).

      [8] Lourenço, H.R., Martin, O.C. and Stützle, T., 2003. Iterated local search. In Handbook of metaheuristics (pp. 320-353). Springer, Boston, MA.

      [9] Dias, M.A.G. and Teixeira, J.P., 2003. Continuous-time option games: review of models and extensions. Part 1: Duopoly under uncertainty. In Proceedings of the 2003 International Real Options Conference, George Town University, USA.

      [10] Sobolev, B., Harel, D., Vasilakis, C. and Levy, A., 2008. Using the Statecharts paradigm for simulation of patient flow in surgical care. Health Care Management Science, 11(1), pp.79-86.

      [11] Boudali, I. and Mokhtar, N., 2016. Harmony Search Approach for Patient Scheduling in Emergency Laboratories. In GCAI (pp. 109-123).

      [12] Geem, Z.W., Kim, J.H. and Loganathan, G.V., 2001. A new heuristic optimization algorithm: harmony search. Simulation, 76(2), pp.60-68.

      [13] Range, T.M., Lusby, R.M. and Larsen, J., 2014. A column generation approach for solving the patient admission-scheduling problem. European Journal of Operational Research, 235(1), pp.252-264.

      [14] Kifah, S. and Abdullah, S., 2015. An adaptive non-linear great deluge algorithm for the patient-admission problem. Information Sciences, 295, pp.573-585.

      [15] Bilgin, B., Demeester, P., Misir, M., Vancroonenburg, W. and Berghe, G.V., 2012. One hyper-heuristic approach to two timetabling problems in health care. Journal of Heuristics, 18(3), pp.401-434.

      [16] Ceschia, S. and Schaerf, A., 2009, October. Multi-neighborhood local search for the patient admission problem. In International Workshop on Hybrid Metaheuristics (pp. 156-170). Springer, Berlin, Heidelberg.

      [17] Demeester, P., Souffriau, W., De Causmaecker, P. and Berghe, G.V., 2010. A hybrid tabu search algorithm for automatically assigning patients to beds. Artificial Intelligence in Medicine, 48(1), pp.61-70.

      [18] HAMMOURI, A.I. and ALRIFAI, B., 2014. Investigating Biogeography-Based Optimisation for Patient Admission Scheduling Problems. Journal of Theoretical & Applied Information Technology, 70(3).

      [19] Chien, C.F., Tseng, F.P. and Chen, C.H., 2008. An evolutionary approach to rehabilitation patient scheduling a case study. European Journal of Operational Research, 189(3), pp.1234-1253.

      [20] Bolaji, A.L.A., Bamigbola, A.F. and Shola, P.B., 2018. Late acceptance hill climbing algorithm for solving patient admission scheduling problem. Knowledge-Based Systems, 145, pp.197-206.

      [21] Paulussen, T.O., Zöller, A., Heinzl, A., Pokahr, A., Braubach, L. and Lamersdorf, W., 2004. Dynamic patient scheduling in hospitals. Coordination and Agent Technology in Value Networks. GITO, Berlin, pp.149-174.

      [22] Turhan, A.M. and Bilgen, B., 2017. Mixed integer programming based heuristics for the Patient Admission Scheduling problem. Computers & Operations Research, 80, pp.38-49.

  • Downloads

  • How to Cite

    Abdalkareem, Z. A., Amir, A., EhKan, P., & Al-Betar, M. (2018). Patients’ admission scheduling techniques and approaches. International Journal of Engineering & Technology, 7(4), 3569-3573.