Patient treatment queuing management method and system, electronic equipment and storage medium

Abstract

The invention relates to the technical field of queuing management, in particular to a patient treatment queuing management method and system, electronic equipment and a storage medium. The method comprises the following steps: firstly, analyzing registration information of patients to obtain type attributes of the patients, and dividing waiting patients into a common waiting queue and a priority waiting queue; then, different serial number calculation methods are adopted, queuing serial numbers are calculated for the common waiting patients according to the reservation time periods, the time period number quantities and the registration times, and queuing serial numbers are determined for the priority waiting patients based on the priority types and the registration times of the priority waiting patients; and finally, through a designed preset interval rule, inserting the patients in the priority waiting queue into the common waiting queue according to a scientific time interval to form a final unified waiting queue. By introducing the preset interval rule, uniform distribution of the prior patients is achieved, stacking insertion of the prior patients is avoided, meanwhile, relative fairness of waiting time of common patients is guaranteed, and normalization and scientificity of the overall waiting order are improved.

Description

Technical Field

[0001] This application relates to the technical field of queue management, and in particular to a method, system, electronic device, and storage medium for managing patient visit queues. Background Technology

[0002] With the rapid growth in demand for medical services and the continuous increase in the number of patients visiting hospitals, the importance of waiting room management has become increasingly prominent. Reasonable queue management not only relates to the effective utilization of medical resources but also directly affects patients' medical experience and the quality of hospital services. How to achieve scientific and efficient waiting room management has become an important issue in hospital information technology development.

[0003] Currently, hospitals commonly use intelligent triage systems for waiting room management. These systems use automated call systems to queue patients according to their arrival order and include priority queue functions. Some systems can also automatically adjust the call frequency based on the workload of the treatment area, achieving basic intelligent queuing management.

[0004] However, existing technologies can only achieve simple first-come-first-served sorting or fixed priority insertion, and cannot perform flexible queue scheduling based on different patient types. This can easily lead to excessively long waiting times for ordinary patients, affecting their medical experience and overall treatment efficiency. This situation needs further improvement. Summary of the Invention

[0005] To address the problem that existing patient queue management methods cannot flexibly schedule queues based on different patient types, easily leading to excessively long waiting times for ordinary patients and affecting the patient experience and overall treatment efficiency, this application provides a patient queue management method, system, electronic device, and storage medium, employing the following technical solution: Firstly, this application provides a method for managing patient queuing for medical treatment, comprising the following steps: The patient type is obtained by checking in the waiting patients, and the waiting patients are divided into ordinary waiting queue and priority waiting queue according to the patient type; The queue number for ordinary waiting patients is calculated based on their appointment time, number of time slots, and check-in time. Based on the priority type and check-in time of the patients waiting for priority treatment, the queue number of the priority waiting queue is determined; Using the queue numbers of the general waiting queue and the priority waiting queue, a final unified waiting queue is generated according to the principles of priority treatment and uniform interval. The priority waiting queue is inserted into the general waiting queue according to a preset interval rule.

[0006] By adopting the above technical solution, this application addresses the problem of uneven distribution of waiting times for ordinary patients due to the lack of scientific insertion of priority patients in existing queuing systems, while also avoiding queue congestion caused by the concentrated insertion of priority patients during peak hours. Firstly, it analyzes patient registration information to obtain their type attributes, dividing waiting patients into ordinary waiting queues and priority waiting queues. Then, it uses different numbering methods to calculate the queue number for ordinary waiting patients based on their appointment time, time slot number, and registration time, while for priority waiting patients, the queue number is determined based on their priority type and registration time. Finally, through a pre-designed interval rule, patients in the priority waiting queue are inserted into the ordinary waiting queue at scientifically defined time intervals, forming a final unified waiting queue. The introduction of the pre-designed interval rule achieves a uniform distribution of priority patients, avoids their concentrated insertion, ensures relative fairness in waiting times for ordinary patients, and improves the standardization and scientific nature of the overall waiting order.

[0007] Optionally, insert into the regular waiting queue according to a preset interval rule, specifically including the following steps: An adaptive interval model is constructed based on the real-time consultation rate and the number of waiting patients in the clinic area. The adaptive interval model dynamically adjusts the priority insertion density according to the congestion level of the clinic area. The insertion position calculation parameters are obtained through the adaptive interval model and the priority waiting queue number, and the target insertion interval for priority patients is determined based on the calculation parameters. Based on the queuing number of the ordinary waiting queue and the dynamic interval coefficient output by the adaptive interval model, the specific insertion position of the priority patient is calculated. Based on the specific insertion position, patients in the priority waiting queue are sequentially inserted into the ordinary waiting queue, and the parameters of the adaptive interval model are updated in real time.

[0008] By adopting the above technical solution, this application addresses the problem in existing systems where the insertion position of priority patients is fixed and cannot be dynamically adjusted according to the real-time situation of the clinic area. For example, during peak hours at a general outpatient clinic, the fixed-interval insertion method leads to excessive concentration of priority patients in certain time periods, causing a sharp increase in waiting time and uneven distribution for ordinary patients. This application first monitors the consultation rate and the number of waiting patients in the clinic area in real time, constructing an interval model that can automatically adjust according to the level of congestion. When the clinic area is congested, the priority insertion density is appropriately reduced; conversely, the insertion density is increased. Then, based on this adaptive model and the queue number of priority patients, the system calculates... The system generates reasonable insertion position parameters and determines the target range for each priority patient to be inserted based on these parameters. Then, it combines the real-time sequence number distribution of the ordinary waiting queue with the dynamic interval coefficient output by the model to calculate the optimal insertion position for priority patients. Finally, according to the calculated specific positions, patients in the priority queue are inserted into the ordinary queue in sequence. At the same time, the system continuously collects insertion effect data and updates the model parameters. This allows the insertion process of priority patients to be intelligently adjusted according to the real-time situation of the clinic area, ensuring the timeliness of priority treatment while avoiding excessive congestion in local periods, thus improving the smoothness and balance of the overall waiting order.

[0009] Optionally, the waiting patient registration information includes basic patient information and visit attributes. Based on the patient type, the waiting patients are divided into a general waiting queue and a priority waiting queue, specifically including the following steps: The patient priority range is obtained by using the patient's basic information and the patient visit attributes, and the waiting patients are divided into VIP patients, emergency patients, returning patients and ordinary patients according to the patient priority range. Based on the patient differentiation results and preset priority rules, the priority level of the patients is determined; Patients are assigned to either the general waiting queue or the priority waiting queue based on their priority level.

[0010] By adopting the above technical solution, this application first collects basic patient information, including identity information, age, and medical history, as well as visitor attribute information such as appointment type, department, and symptom description. Through comprehensive analysis of this information, the coverage area for priority patients is determined. Then, based on the determined scope, waiting patients are specifically divided into four categories: VIP patients, emergency patients, returning patients, and general patients. Next, the system determines the specific priority level for each patient according to pre-set priority rules, such as emergency patients having higher priority than VIP patients, and returning patients having different priorities depending on their condition. Finally, based on the calculated priority level, the system automatically assigns patients to the corresponding waiting queue. This achieves accurate identification and reasonable classification of different types of patients, ensuring both the priority needs of special patients and maintaining the fairness of the overall waiting order.

[0011] Optionally, the calculation of the queue number for the general waiting area based on the appointment time, time slot number, and check-in time of the general waiting patients further includes the following steps: The time slot reference number is obtained through the appointment time slot, and the initial number of ordinary waiting patients is determined based on the time slot reference number. Calculate waiting parameters based on the time period number and the check-in time, and obtain sequence number adjustment values ​​based on the waiting parameters; The final queue number for ordinary waiting patients is determined based on the initial sequence number and the sequence number adjustment value.

[0012] By adopting the above technical solution, this application proposes a dynamic sequence number calculation scheme. First, the corresponding time slot baseline sequence number is obtained based on the patient's appointment time slot information to determine the patient's initial queuing position within that time slot. Then, based on the total number of available appointment slots for that time slot and the patient's actual arrival time, adjustment parameters reflecting the waiting situation are calculated. For example, patients who arrive early are given appropriate priority weights, while those who arrive late are given correspondingly lower weights. Finally, the initial sequence number is combined with the adjustment value calculated based on the waiting parameters to obtain the patient's final queuing sequence number. By introducing a time slot-based baseline sequence number and a dynamic adjustment mechanism, the basic principles of appointment order are guaranteed, while flexible adjustments can be made according to the actual arrival situation, thus improving the scientificity and rationality of the general waiting queue sorting.

[0013] Optionally, based on the priority type and check-in time of the priority waiting patients, the priority waiting queue number is determined, specifically including the following steps: Based on the priority type and check-in time of the priority waiting patients; The patient priority coefficient is obtained through the priority type, and the basic priority number is determined based on the patient priority coefficient. Priority parameters are calculated based on the arrival time and the number of patients waiting for treatment, and priority number adjustment values ​​are obtained based on the priority parameters. The final queuing number of the priority waiting queue is determined based on the basic priority number and the priority number adjustment value.

[0014] By adopting the above technical solution, this application first establishes a system based on the specific type of priority waiting patients; then, it sets corresponding priority coefficients according to different priority types and calculates the basic priority number accordingly; next, it comprehensively considers the actual check-in time of the patients and the total number of people currently waiting to calculate the priority parameters that reflect the time sequence, and obtains the sequence number adjustment value from this; finally, it performs a weighted calculation of the basic priority number and the priority number adjustment value to obtain the final queuing number in the priority waiting queue; by introducing a dual adjustment mechanism of priority coefficients and dynamic priority parameters, it not only ensures differentiated treatment for different types of priority patients, but also allows for flexible adjustments based on the actual situation.

[0015] Optionally, the method further includes the following steps: The identification attribute is obtained by the priority type of the priority waiting patient, and the display mark of the priority patient is set according to the identification attribute; Based on the display markers and insertion position information, the identification display method of priority patients in the queue is determined to achieve the identifiability of priority patients during the insertion process.

[0016] By adopting the above technical solution, this application obtains the identification attribute through the priority type of priority waiting patients, sets the display mark of priority patients through the identification attribute, and determines the identification display method of priority patients in the queue based on the display mark and insertion position information, so as to realize the identity recognition of priority patients in the insertion process; thereby making the information of each type of patient transparent and visualized, and increasing fairness.

[0017] Secondly, this application provides a patient visit queuing management system, comprising: The patient classification module is used to obtain the patient type through the waiting patient check-in information, and to divide the waiting patients into the general waiting queue and the priority waiting queue according to the patient type. The ordinary queue number calculation module is used to calculate the queue number of ordinary waiting patients based on their appointment time, number of time slots, and check-in time. The priority number calculation module is used to determine the priority waiting queue number based on the priority type and check-in time of the priority waiting patients. The queue generation module is used to generate a final unified waiting queue based on the queuing numbers of the ordinary waiting queue and the queuing numbers of the priority waiting queue, according to the principles of priority treatment and uniform interval. The priority waiting queue is inserted into the ordinary waiting queue according to a preset interval rule, and the transparency of the priority patient identification is maintained during the insertion process.

[0018] Thirdly, this application provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the above-described patient visit queuing management method.

[0019] Fourthly, this application provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the above-described patient visit queuing management method.

[0020] In summary, this application includes at least one of the following beneficial technical effects: This application first analyzes patient registration information to obtain their type attributes, dividing waiting patients into a general waiting queue and a priority waiting queue. Then, different numbering methods are used to calculate the queue number for general waiting patients based on their appointment time, time slot number, and registration time, while for priority waiting patients, the queue number is determined based on their priority type and registration time. Finally, through a pre-designed interval rule, patients in the priority waiting queue are inserted into the general waiting queue at scientifically defined time intervals, forming a final unified waiting queue. By introducing the pre-designed interval rule, a uniform distribution of priority patients is achieved, avoiding overcrowding, while ensuring relative fairness in waiting time for general patients, thus improving the standardization and scientific nature of the overall waiting order. This application constructs an interval model that automatically adjusts according to the level of congestion by real-time monitoring of the consultation rate and the number of waiting patients in the consultation area. When the consultation area is congested, the priority insertion density is reduced, and vice versa. Based on this adaptive model and the priority patient queue number, the insertion position parameters are calculated to determine the target interval for insertion. Combining the distribution of the ordinary waiting queue number and the dynamic interval coefficient, the optimal insertion position for priority patients is calculated. Then, priority patients are inserted into the ordinary queue in sequence, and the model parameters are continuously updated. This allows the priority patient insertion process to intelligently adapt to the real-time situation of the consultation area, ensuring the timeliness of priority consultation, avoiding local congestion, and improving the smoothness and balance of the waiting order. This application first establishes the system based on the specific type of priority waiting patients; then, it sets corresponding priority coefficients according to different priority types and calculates the basic priority number accordingly; next, it comprehensively considers the actual check-in time of patients and the total number of people currently waiting to calculate priority parameters that reflect time sequence, and obtains the sequence number adjustment value from this; finally, it performs a weighted calculation of the basic priority number and the priority number adjustment value to obtain the final queuing number in the priority waiting queue; by introducing a dual adjustment mechanism of priority coefficients and dynamic priority parameters, it not only ensures differentiated treatment for different types of priority patients, but also allows for flexible adjustments based on the actual situation. Attached Figure Description

[0021] Figure 1 This is a flowchart illustrating a patient queuing management method according to an embodiment of this application; Figure 2 This is a schematic diagram of the queue management process using an adaptive interval model in an embodiment of this application; Figure 3 This is a schematic diagram of a patient visit queuing management system according to an embodiment of this application; Figure 4 This is an internal structural diagram of an electronic device according to an embodiment of this application. Detailed Implementation

[0022] The terminology used in the following embodiments of this application is for the purpose of describing particular embodiments only and is not intended to be limiting of this application. As used in the specification and appended claims of this application, the singular expressions “a,” “an,” “the,” “the,” “the,” and “this” are intended to include the plural expressions as well, unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used in this application refers to any or all possible combinations including one or more of the listed items.

[0023] Hereinafter, the terms "first" and "second" are used for descriptive purposes only and should not be construed as implying or suggesting relative importance or implicitly indicating the number of indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature, and in the description of the embodiments of this application, unless otherwise stated, "multiple" means two or more.

[0024] The embodiments of this application will now be described in further detail with reference to the accompanying drawings.

[0025] Firstly, this application provides a method for managing patient queuing for medical treatment, referring to... Figure 1 It includes the following steps: S110. Obtain patient type through patient registration information, and divide patients into ordinary waiting queue and priority waiting queue according to patient type.

[0026] The patient's basic information includes their identity, age, and medical history, while their visit attribute information includes appointment type, department visited, and symptom description. This comprehensive analysis of the information determines the coverage area for priority patients; then, based on this defined area, waiting patients are further categorized into four groups: VIP patients, emergency patients, returning patients, and general patients.

[0027] Specifically, patient types are determined through patient registration information, which includes basic patient information and visit attributes. Basic patient information can be stored in the hospital's information system, such as the patient's age and whether they are a hospital employee. Visit attributes include the department visited and whether it is an emergency. This information is used to determine the priority patient range, which is then categorized into VIP patients, emergency patients, returning patients, and regular patients. VIP patients are identified based on their basic information, such as elderly individuals, disabled individuals, hospital employees, or retired cadres. Emergency patients are assigned an emergency priority tag by the triage nurse based on their condition. Returning patients register again at the triage desk, where the triage nurse re-adds them to the priority queue. Based on the patient classification results and preset priority rules, the patient's priority level is determined. These preset priority rules can be set according to the hospital's actual situation; for example, emergency patients have the highest priority, followed by VIP patients, and then returning patients. Patients are then assigned to either the regular waiting queue or the priority waiting queue based on their priority level. The patient classification method here can be replaced by classifying patients according to the severity of their condition, with those with milder conditions classified as ordinary patients and those with more severe conditions classified as priority patients.

[0028] S120. Calculate the queue number of the general waiting line based on the appointment time, time slot number, and check-in time of the general waiting patients.

[0029] In this embodiment, the queue number for ordinary waiting patients is calculated based on their appointment time slot, the number of appointment slots available, and their check-in time. A base queue number is obtained from the appointment time slot; for example, hospitals publish doctor schedules in advance, including appointment times. Different appointment times correspond to different base queue numbers, and the initial queue number for ordinary waiting patients is determined based on this base queue number. Waiting parameters are calculated based on the number of appointment slots available per slot and the check-in time, which is the time the patient arrives at the corresponding department's waiting area to check in. An adjustment value for the queue number is obtained based on the waiting parameters; if a patient is late, their queue number may be delayed. The final queue number for ordinary waiting patients is determined based on the initial queue number and the adjustment value. During the calculation process, the formula parameters can be flexibly set according to the actual needs of different clinic areas to adapt to their specific requirements.

[0030] Specifically, the process begins by calculating the time-segment baseline score, which is the time difference (in hours) between the start time of the appointment slot and the start time of the shift. This score is divided by the number of hours in a single time slot and then multiplied by the number of slots per slot. Next, the patient's check-in sequence number within the same time slot is added. If a patient is late, a lateness penalty value is calculated: the larger of zero and the number of late slots, multiplied by the lateness extension time setting and then by the number of slots per slot. If the patient's check-in time exceeds the end time of the appointment slot, an additional lateness extension setting value is added. Based on the waiting parameters, a sequence number adjustment value is obtained; if a patient is late, the sequence number may be delayed. Finally, based on the initial sequence number and the sequence number adjustment value, the queue number for ordinary waiting patients is determined. During the calculation process, the formula parameters can be flexibly set according to the actual needs of different clinic areas.

[0031] S130. Based on the priority type and check-in time of the priority waiting patients, determine the queue number of the priority waiting queue.

[0032] In this embodiment, based on the priority type and check-in time of priority waiting patients, a patient priority coefficient is obtained through the priority type. Different types of priority patients have different priority coefficients, such as 0.1 for emergency patients, 0.6 for elderly patients, and 1 for returning patients. The smaller the coefficient, the higher the priority. A basic priority number is determined based on the patient priority coefficient. Priority parameters are calculated based on check-in time and the number of waiting patients, and priority number adjustment values ​​are obtained based on these parameters. The final queue number in the priority waiting queue is determined based on the basic priority number and the priority number adjustment value. The priority queue number calculation can also be adjusted based on the urgency of the patient's condition; the more urgent the condition, the earlier the queue number.

[0033] Specifically, the priority queue score is calculated by multiplying the patient's arrival order number by the corresponding priority coefficient. The score calculation formula is: Priority Queue Score = Arrival Order Number × Priority Coefficient. Here, the arrival order number indicates which number of the priority patient has arrived, and the priority coefficient is set according to the patient type; the smaller the value, the higher the priority. The system sorts priority patients in ascending order of their scores, with patients having lower scores appearing earlier in the queue. For example, the 3rd emergency patient (coefficient 0.1) has a score of 0.3, the 1st elderly VIP patient (coefficient 0.6) has a score of 0.6, and the 2nd returning patient (coefficient 1) has a score of 2. The final ranking is: Emergency Patient (number 1), Elderly VIP Patient (number 2), Returning Patient (number 3). The priority queue number calculation can also be adjusted based on the urgency of the patient's condition; the more urgent the condition, the earlier the queue number.

[0034] S140. Using the queue numbers of the ordinary waiting queue and the priority waiting queue, generate the final unified waiting queue according to the principles of priority treatment and uniform interval. The priority waiting queue is inserted into the ordinary waiting queue according to the preset interval rules.

[0035] In this embodiment, a final unified waiting queue is generated using the queue numbers of the regular waiting queue and the priority waiting queue, based on the principles of priority access and even spacing. The priority waiting queue is inserted into the regular waiting queue according to a preset interval rule. This preset interval rule can be set according to the actual situation of the clinic area to ensure that priority patients are evenly distributed throughout the regular waiting queue.

[0036] During the insertion process, the system obtains the identification attribute based on the priority type of the priority waiting patient, and sets the display mark for the priority patient according to the identification attribute. Based on the display mark and insertion position information, the system determines the display method of the priority patient's identification in the queue, ensuring the identification of the priority patient during the insertion process. For example, priority patients have priority marks such as "VIP", "urgent", and "return", maintaining transparency regarding queue jumping. The triage queue consists of 1 "in consultation" patient + 2 "please prepare" patients + several "waiting" patients. If a "please prepare" patient becomes vacant, the system automatically selects the patient at the front of the queue from the "waiting" patients to fill the vacancy. The status of the filling patient automatically changes from "waiting" to "please prepare", and the display screen at the doctor's office door only shows the patient in the "please prepare" status. The queue position of the "please prepare" patient is fixed and cannot be interrupted by priority patients. The doctor changes the status of the first "please prepare" patient to "calling" through the "call" function of the outpatient doctor's workstation. The first patient in the "waiting" queue becomes the second patient in the "please prepare" queue. If the doctor calls the patient three times without seeing them, the patient is considered a missed patient, and the queue automatically moves N positions back according to system settings. The preset interval rule here can be replaced with a dynamic adjustment based on the doctor's consultation speed. If the doctor's consultation speed is fast, the insertion interval for priority patients can be appropriately reduced.

[0037] Specifically, the generation of the final unified waiting queue adopts a "plum blossom interleaving" algorithm. Let the ordinary waiting queue A contain m patients: A1, A2, ..., A... m The priority waiting queue B contains n patients: B1, B2, ..., B n The system evenly inserts the priority queue into the ordinary queue according to a preset interval parameter k (usually set to 1 or 2): when the interval parameter k=1, the merged unified queue is: B1, A1, B2, A2, ..., A m When the interval parameter k=2, the merged unified queue is: B1, A1, A2, B2, A3, ..., A mFor example, if there are 8 people in the regular waiting queue (Regular 1 to Regular 8) and 3 people in the priority waiting queue (Preferred 1 to Preferred 3), with an interval of 1, the final queue order will be: Preferred 1, Regular 1, Preferred 2, Regular 2, Preferred 3, Regular 3, Regular 4, Regular 5, Regular 6, Regular 7, Regular 8. All priority patients have clear priority labels (such as "VIP," "Urgent," "Return," etc.) to ensure transparency in the queue-jumping process.

[0038] In one embodiment, refer to Figure 2 In step S140, the patient is inserted into the regular waiting queue according to a preset interval rule, which specifically includes the following steps: S141. Construct an adaptive interval model based on the real-time consultation rate and the number of waiting patients in the clinic area.

[0039] Among them, the adaptive interval model dynamically adjusts the priority insertion density according to the congestion level of the clinic area.

[0040] In this embodiment, the real-time consultation rate of the clinic area refers to the number of patients who complete their consultations per hour, which is calculated from the doctor's call record; the number of waiting patients refers to the sum of ordinary waiting patients who have not yet received their consultations and priority waiting patients; the adaptive interval model is a calculation model that dynamically adjusts the insertion interval of priority patients based on the congestion status of the clinic area.

[0041] Specifically, the system collects patient visit rate data every 5 minutes, records the average patient visit rate over the past hour, and simultaneously calculates the total number of currently waiting patients. Based on these two indicators, the system calculates a congestion coefficient and substitutes it into a preset interval adjustment function to obtain the priority insertion density value for the current time period. When the congestion coefficient increases, the system automatically decreases the priority insertion density; when the congestion coefficient decreases, the priority insertion density is increased accordingly.

[0042] Furthermore, the adaptive interval model can be constructed based on multi-dimensional congestion assessment, including three assessment dimensions: doctor on-duty status, clinic saturation, and historical congestion patterns. Doctor on-duty status is obtained by monitoring the login information of doctors' workstations to obtain the real-time number of doctors in attendance, and this is compared with the department's schedule to calculate the doctor attendance rate. Clinic saturation is assessed based on the ratio of clinic physical capacity to the actual number of patients. The system pre-establishes a clinic capacity parameter table, recording the number of waiting seats, clinic area, and clinic type for each clinic. Historical congestion patterns are predicted by establishing a time-series database to store historical patient data from different time periods and departments, using time-series analysis methods. The system substitutes the assessment results of these three dimensions into a preset scoring matrix, with doctor on-duty status weighted at 0.4, clinic saturation weighted at 0.3, and historical congestion patterns weighted at 0.3, to calculate a comprehensive congestion score. This score serves as an input parameter for the adaptive interval model, used to dynamically adjust the priority patient insertion strategy.

[0043] S142. Obtain the insertion position calculation parameters through the adaptive interval model and the priority waiting queue number, and determine the target insertion interval for priority patients based on the calculation parameters.

[0044] In this embodiment, the insertion position calculation parameters include a base interval value, a dynamic adjustment coefficient, and a target interval range. The target insertion interval refers to the range of ordinary waiting queue numbers into which priority patients can be inserted, which is determined by the priority patient's queue number and the current interval parameter.

[0045] Specifically, the system pre-establishes an interval parameter mapping table to store basic interval values ​​under different congestion levels. When a priority patient needs to be inserted, the system first queries the mapping table to obtain the basic interval value, and then combines it with the adjustment coefficient output by the adaptive model to calculate the actual interval number. Based on the priority patient's queue number, the actual interval number is mapped to the ordinary waiting queue to determine the target insertion interval range for that priority patient.

[0046] S143. Based on the queuing number of the ordinary waiting queue and the dynamic interval coefficient output by the adaptive interval model, the specific insertion position of the priority patient is calculated.

[0047] In this embodiment, the dynamic interval coefficient is an adjustment parameter calculated in real time by the adaptive interval model based on the current status of the clinic area; the specific insertion position refers to the precise sequence number position of the priority patient when finally inserted into the ordinary waiting queue, which needs to take into account the distribution of ordinary patients within the target interval.

[0048] Specifically, after determining the target insertion interval, the system statistically analyzes the distribution density of ordinary patients within that interval and establishes a local patient distribution table. Combining this with a dynamic interval coefficient, the system calculates the uniformity score for each possible insertion position within the interval. The position with the highest uniformity score is selected as the specific insertion position for that priority patient, ensuring a more balanced queue distribution after insertion.

[0049] S144. Based on the specific insertion position, insert patients in the priority waiting queue into the ordinary waiting queue in sequence, and update the parameters of the adaptive interval model in real time.

[0050] In this embodiment, the sequential insertion of priority patients refers to inserting priority patients one by one into a designated position according to the queuing order of the priority waiting queue; the model parameter update includes real-time adjustment of three dimensions: congestion coefficient, interval coefficient, and uniformity score.

[0051] Specifically, the system maintains an insertion performance evaluation table, recording the exact location of each insertion operation, the queue status at that time, and the change in uniformity after insertion. The system periodically analyzes the evaluation table data and updates the relevant parameters of the adaptive interval model, including adjusting the calculation weight of the congestion coefficient, optimizing the value range of the interval coefficient, and improving the calculation method of the uniformity score, thereby continuously optimizing the insertion performance.

[0052] It should be understood that the sequence number of each step in the above embodiments does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.

[0053] Secondly, this application provides a patient visit queuing management system. The patient visit queuing management system of this application will be described below in conjunction with the above-mentioned patient visit queuing management method.

[0054] Reference Figure 3 A patient visit queuing management system includes: The patient classification module is used to obtain the patient type through the patient check-in information and to divide the waiting patients into the general waiting queue and the priority waiting queue according to the patient type. The ordinary queue number calculation module is used to calculate the queue number of ordinary waiting patients based on their appointment time, number of time slots, and check-in time. The priority number calculation module is used to determine the priority waiting queue number based on the priority type and check-in time of the priority waiting patients. The queue generation module is used to generate a final unified waiting queue based on the queuing numbers of the ordinary waiting queue and the queuing numbers of the priority waiting queue, according to the principles of priority treatment and uniform interval. The priority waiting queue is inserted into the ordinary waiting queue according to a preset interval rule, and the transparency of the priority patient identification is maintained during the insertion process.

[0055] In one embodiment, this application provides an electronic device, which may be a server, and its internal structure diagram may be as follows: Figure 4 As shown, the electronic device includes a processor, memory, and a network interface connected via a system bus. The processor provides computing and control capabilities. The memory includes a non-volatile storage medium and internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage medium. The database stores data. The network interface communicates with external terminals via a network connection. When the computer program is executed by the processor, it implements a patient queuing management method.

[0056] Those skilled in the art will understand that Figure 4 The structure shown is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the electronic device to which the present application is applied. The specific electronic device may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0057] In one embodiment, an electronic device is also provided, including a memory and a processor, wherein the memory stores a computer program, and the processor executes the computer program to implement the steps in the above-described method embodiments.

[0058] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments of the above methods. Any references to memory, storage, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, or optical storage, etc. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc.

[0059] The above are all preferred embodiments of this application and are not intended to limit the scope of protection of this application. Therefore, all equivalent changes made in accordance with the structure, shape and principle of this application should be covered within the scope of protection of this application.

Claims

1. A patient appointment queuing management method, characterized by, The method comprises the following steps: obtaining a patient type through the check-in information of the waiting patients, and dividing the waiting patients into a common waiting queue and a priority waiting queue according to the patient type; calculating a queue number of the common waiting queue according to a reservation time period, a time period number and a check-in time of the common waiting patient; determining a queue number of the priority waiting queue based on a priority type and a check-in time of the priority waiting patient; generating a final unified waiting queue according to the queue number of the common waiting queue and the queue number of the priority waiting queue, and according to the principle of priority treatment and uniform interval, wherein the priority waiting queue is inserted into the common waiting queue according to a preset interval rule.

2. The patient appointment queuing management method according to claim 1, characterized by, The step of inserting the common waiting queue according to the preset interval rule comprises the following steps: constructing an adaptive interval model based on a real-time treatment rate of a diagnosis area and a number of waiting patients, wherein the adaptive interval model dynamically adjusts the priority insertion density according to the congestion degree of the diagnosis area; obtaining an insertion position calculation parameter through the adaptive interval model and the queue number of the priority waiting queue, and determining a target insertion interval of the priority patient according to the calculation parameter; calculating a specific insertion position of the priority patient based on the queue number of the common waiting queue and a dynamic interval coefficient output by the adaptive interval model; inserting the patients in the priority waiting queue into the common waiting queue according to the specific insertion position, and updating the parameters of the adaptive interval model in real time.

3. The patient appointment queuing management method according to claim 1, characterized by, The check-in information of the waiting patients comprises patient basic information and treatment attributes, and the waiting patients are divided into the common waiting queue and the priority waiting queue according to the patient type, which comprises the following steps: obtaining a priority patient range through the patient basic information and the treatment attributes, and dividing the waiting patients into VIP patients, emergency patients, return patients and common patients according to the priority patient range; determining a priority level of the patient based on the patient division result and a preset priority rule; judging the patient attribution according to the priority level, so as to assign the patient to the common waiting queue or the priority waiting queue.

4. The patient appointment queuing management method according to claim 1, characterized by, The queue number of the common waiting queue is calculated according to the reservation time period, the time period number and the check-in time of the common waiting patient, and further comprises the following steps: obtaining a time period reference number through the reservation time period, and determining an initial sequence number of the common waiting patient according to the time period reference number; calculating a waiting parameter based on the time period number and the check-in time, and obtaining a sequence number adjustment value according to the waiting parameter; determining the final queue number of the common waiting patient according to the initial sequence number and the sequence number adjustment value.

5. The patient appointment queuing management method according to claim 1, characterized by, The queue number of the priority waiting queue is determined based on the priority type and the check-in time of the priority waiting patient, which comprises the following steps: obtaining a patient priority level coefficient through the priority type, and determining a basic priority sequence number according to the patient priority level coefficient; calculating a priority parameter based on the check-in time and the number of waiting patients, and obtaining a priority sequence number adjustment value according to the priority parameter; determining the final queue number of the priority waiting queue according to the basic priority sequence number and the priority sequence number adjustment value. The method further comprises the following steps:

6. The patient appointment queuing management method according to claim 1, characterized by, ​ An identification attribute is obtained through the priority type of the priority queuing patient, and a display mark of the priority patient is set according to the identification attribute; Based on the display mark and the insertion position information, an identification display mode of the priority patient in the queue is determined, so as to realize the identity recognizability of the priority patient in the insertion process.

7. A patient appointment queuing management system, characterized by, The method comprises the steps of: A patient classification module is configured to obtain a patient type through queuing patient check-in information, and divide the queuing patient into an ordinary queuing queue and a priority queuing queue according to the patient type; An ordinary serial number calculation module is configured to calculate an ordinary queuing queue serial number according to a reservation time period, a time period number and a check-in time of the ordinary queuing patient; A priority serial number calculation module is configured to determine a priority queuing queue serial number based on a priority type and a check-in time of the priority queuing patient; A queue generation module is configured to generate a final unified queuing queue according to the priority queuing and uniform interval principle by using the ordinary queuing queue serial number and the priority queuing queue serial number, wherein the priority queuing queue is inserted into the ordinary queuing queue according to a preset interval rule, and the priority patient identification is kept transparent in the insertion process.

8. An electronic device, comprising: The computer program is executed by the processor to realize the steps of the patient queuing management method in any one of claims 1-6.

9. A computer readable storage medium having stored thereon a computer program, characterized in that, The computer program is executed by the processor to realize the steps of the patient queuing management method in any one of claims 1-6.

Images