{'fraction_non_alphanumeric': 0.01306532663316583, 'fraction_numerical': 0.0, 'mean_word_length': 4.858823529411764, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A New Queuing Algorithm of Ophthalmic Hospital Beds Arrangement

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.