A New Queuing Algorithm of Ophthalmic Hospital Beds Arrangement

Abstract:

In this paper, we build a new queuing algorithm based on Multi-objective linear programming about the ophthalmic hospital sickbeds arrangement. In the new algorithm we divide the traditional queue into four subqueues depending on the different treatment of diseases and following the law of FCFS. We find a random day for reference and count the data of this day, and then we focus on the arrangement of the next day, which means to choose how many patients from each of the four subqueues to be settled into hospital in the next day. Considering the fair principle, the utilization of sickbeds, and the waiting time of the patients, we found an objective function with several constraint conditions to calculate the arrangement of the next day. In order to simplify the constraint conditions, we transfer the length of the queues into the waiting time of patients and finally get the result through programming by Lingo software.

• Periodical: Advanced Materials Research (Volumes 433-440)
• Pages: 1971-1974
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.433-440.1971
• Online since: January 2012
• Authors: Ran Hu, Jing Shuang Hu, Ying Wu
• Keywords: Linear Weighted Average, Multi-Objective Linear Programming, Queuing Theory, Subqueues, Waiting Time for Hospitalization, Waiting Time for Surgery

References

[1] Ren Guohong, Yin Xingyan: A research about a stimulation hospital beds turnover times of economic growth factors (Armed police medical 2002).

[2] Xu Yu, Tao Qiankan: The sick hospitalization queuing models and its application (Xi 'an jiaotong university journal).

[3] Xie Juan, Ma Guijin: Hospital beds work efficiency analysis and evaluation (Chinese medical record 2009).

[4] Xie Jinxing, Xue Yi: Optimization modeling and Lindo/Lingo software (Tsinghua university press 2005. 7).

[5] Zhao Jing, Dan Qi: Mathematical modeling and mathematics experiment (2nd edition), Beijing: higher education press, 2003. 6.