Double-random low-speed queuing processing method and device for hospital appointment registration system

Abstract

The invention provides a double-random low-speed queuing processing method and device for a hospital appointment registration system, and the method and device form a double-random low-speed queuing processing architecture through combining a queuing queue mechanism and a request random extraction mechanism, thereby effectively limiting the malicious registration behavior, the number-reversing behavior and the expansion of the number-reversing behavior, and improving the registration efficiency. Therefore, the number source utilization rate is effectively improved, the appointment doctor-seeing efficiency of the patient is improved, and the doctor-seeing experience of the patient is improved.

Description

Technical Field

[0001] The present application relates to the field of hospital appointment registration, and in particular to a double random slow queuing processing method and device for a hospital appointment registration system. Background Art

[0002] Number management is one of the important tasks of hospital outpatient management. A reasonable number allocation and management mechanism will effectively promote number utilization, improve patient appointment efficiency, and improve patient medical experience.

[0003] With the escalation of social and hospital governance, the methods of "ticket scalpers (or scalpers)" are also changing and updating. By analyzing the characteristics of "ticket scalpers" activities, it can be found that the means of "ticket scalpers" to seize and resell tickets have changed from queuing on site to taking advantage of loopholes in the online channels of the appointment platform to seize tickets, canceling appointments in advance or canceling the appointment at the window after picking up the number on the day of the appointment, and quickly using the patient's medical card to reschedule the appointment through the appointment platform or the hospital's on-site self-service machine. Therefore, how to strengthen the system security of the hospital's number source management platform has become an important means to prevent ticket scalpers from reselling tickets.

[0004] The inventor of this application has discovered that, in the prior art, the slow queuing scheme of the hospital appointment registration system still has certain defects in preventing "ticket scalpers", which can be reflected in the proportion of cancellations of appointment registrations. Therefore, corresponding improvements need to be made in order to more effectively prevent malicious registrations. Summary of the invention

[0005] The present application provides a double random slow queue processing method and device for a hospital appointment registration system. By combining a queue mechanism and a request random extraction mechanism, a double random slow queue processing architecture is formed, thereby effectively limiting malicious registration behavior and the development of number reversal behavior, ensuring that normal patients can successfully make appointments and registrations, thereby effectively promoting the utilization rate of number sources, improving the efficiency of patient appointments and medical treatment, and improving the patient's medical experience.

[0006] In a first aspect, the present application provides a double random slow queue processing method for a hospital appointment registration system, the method comprising:

[0007] For the target number source, within a delay time preset to m seconds after the number is released, a first appointment registration request is obtained, wherein the number of requests for the first appointment registration request is multiple, and the number limit of the first appointment registration request is set to t;

[0008] According to the preset first random extraction algorithm, the second appointment registration request is randomly extracted from the first appointment registration request and enters the first queuing queue, wherein the number of the second appointment registration request is multiple, and within the preset delay time of m seconds after the number is released, after the requests in the first queuing queue are processed, new requests are randomly extracted from the updated first appointment registration request for processing until all the target number sources are booked;

[0009] Based on the user behaviors corresponding to the second appointment registration requests in the first queue, normal users and abnormal users among the users corresponding to the second appointment registration requests are screened out;

[0010] For normal user requests, normal appointment registration processing will be carried out;

[0011] For requests from abnormal users, they will be queued until the delay time ends and then processed as normal appointments.

[0012] In a second aspect, the present application provides a double random slow queue processing device for a hospital appointment registration system, the device comprising:

[0013] An acquisition unit is used to acquire a first appointment registration request for a target number source within a delay time preset to m seconds after the number is released, wherein the number of requests for the first appointment registration request is multiple, and the number limit of the first appointment registration request is set to t;

[0014] The extraction unit is used to randomly extract the second appointment registration request from the first appointment registration request according to the preset first random extraction algorithm, and enter the second appointment registration request into the first queue, wherein the number of the second appointment registration request is multiple, and within the preset delay time of m seconds after the number is released, after the requests in the first queue are processed, a new request is randomly extracted from the updated first appointment registration request for processing until all the target number sources are booked;

[0015] A screening unit, configured to screen out normal users and abnormal users among users corresponding to the second appointment registration requests based on user behaviors corresponding to the second appointment registration requests in the first queue;

[0016] The registration unit is used to process normal reservation registration for normal user requests;

[0017] The registration unit is also used to queue up requests from abnormal users until the delay time ends and carry out normal appointment registration processing.

[0018] In a third aspect, the present application provides a processing device, including a processor and a memory, wherein a computer program is stored in the memory, and when the processor calls the computer program in the memory, the method provided in the first aspect of the present application or any possible implementation method of the first aspect of the present application is executed.

[0019] In a fourth aspect, the present application provides a computer-readable storage medium, which stores multiple instructions, and the instructions are suitable for a processor to load to execute the method provided by the first aspect of the present application or any possible implementation of the first aspect of the present application.

[0020] From the above content, it can be concluded that the present application has the following beneficial effects:

[0021] Aiming at the goal of improving the slow queues in the hospital appointment registration system, this application forms a double random slow queue processing architecture by combining the queue mechanism and the request random extraction mechanism, so as to effectively limit the malicious registration behavior and the reversal of number, and ensure that normal patients can successfully make appointments and registrations, thereby effectively promoting the utilization rate of number resources, improving the efficiency of patient appointments and treatment, and improving the patient's medical experience. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For those skilled in the art, other drawings can be obtained based on these drawings without creative work.

[0023] Figure 1 A processing logic diagram of a double random slow queue processing scheme for the hospital appointment registration system in this application;

[0024] Figure 2 A flow chart of a double random slow queuing processing method for a hospital appointment registration system in this application;

[0025] Figure 3 This is another processing logic diagram of the double random slow queuing processing solution of the hospital appointment registration system in this application;

[0026] Figure 4 A structural schematic diagram of a double random slow queuing processing device of the hospital appointment registration system of the present application;

[0027] Figure 5 A schematic diagram of the structure of the processing equipment of this application. DETAILED DESCRIPTION

[0028] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of this application.

[0029] The terms "first", "second", etc. in the specification and claims of this application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments described here can be implemented in an order other than that illustrated or described here. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or modules is not necessarily limited to those steps or modules clearly listed, but may include other steps or modules that are not clearly listed or inherent to these processes, methods, products or devices. The naming or numbering of steps in this application does not mean that the steps in the method flow must be executed in the time / logical sequence indicated by the naming or numbering. The process steps that have been named or numbered can change the execution order according to the technical purpose to be achieved, as long as the same or similar technical effects can be achieved.

[0030] The division of modules in this application is a logical division. There may be other division methods when it is implemented in actual applications. For example, multiple modules can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, and the indirect coupling or communication connection between modules can be electrical or other similar forms, which are not limited in this application. In addition, the modules or submodules described as separate components may or may not be physically separated, may or may not be physical modules, or may be distributed in multiple circuit modules, and some or all of the modules may be selected according to actual needs to achieve the purpose of the present application.

[0031] Before introducing the double random slow queuing processing method for the hospital appointment registration system provided by this application, the background content involved in this application is first introduced.

[0032] The double random slow queue processing method, device and computer-readable storage medium of the hospital appointment registration system provided in this application can be applied to processing equipment. By combining the queuing mechanism and the request random extraction mechanism, a double random slow queue processing architecture is formed, thereby effectively limiting the development of malicious registration behavior and number-reversing behavior, and ensuring that normal patients can successfully make appointments and registrations, thereby effectively promoting the utilization rate of number sources, improving the efficiency of patient appointments and medical treatment, and improving the patient's medical experience.

[0033] The double random slow queue processing method of the hospital appointment registration system mentioned in the present application can be executed by a double random slow queue processing device of the hospital appointment registration system, or a processing device integrated with the double random slow queue processing device of the hospital appointment registration system. Among them, the double random slow queue processing device of the hospital appointment registration system can be implemented in hardware or software, and the processing device is a device equipped with a hospital appointment registration system (or a hospital appointment registration platform), which is usually configured as a server, or in some cases, it can be configured by a physical host or even a user equipment (UE) and other different types of hardware devices, wherein the UE involved can be a terminal device such as a smart phone, a tablet computer, a laptop computer, a desktop computer or a personal digital assistant (PDA). At the same time, in actual situations, the processing device can also be set in the form of a device cluster, and the multiple devices involved in the device cluster can also involve different types of hardware devices.

[0034] It is understandable that the specific equipment types and equipment deployment forms involved in the processing equipment are relatively flexible and can be adaptively configured according to the flexible and changeable application requirements under actual circumstances.

[0035] Next, the double random slow queue processing method for the hospital appointment registration system provided by this application will be better introduced in combination with the slow queue processing solution of the existing hospital appointment registration system.

[0036] The solutions for handling slow queues in the existing hospital appointment registration system mainly involve:

[0037] (1) The system sets a delay time (waiting time) of m seconds from the start of number allocation. When the delay time expires, all users who want to make an appointment will be allocated a number in the order in which they click "Appointment" to complete the appointment.

[0038] (2) During the delay time, the system will analyze all users who request appointments, screen out abnormal users, and put these users into a slow queue. The system sets a waiting delay of n seconds in the slow queue. For users in the delay, the system will display a prompt such as "Queueing, please wait patiently"; after the delay, if there are numbers, the users in the queue will be assigned numbers in the order they entered the slow queue to complete the appointment; if there are no numbers, the prompt is: No number is available. The setting of the slow queue can make it so that abnormal users have to wait for a certain period of time after submitting an appointment request before they can make an appointment with the remaining numbers after normal users complete their appointments. This will make the waiting time longer than that of normal users, which can prevent suspected number dealers from snatching numbers online through software, and is used to punish online number-swiping behavior.

[0039] However, the above slow queuing mechanism will cause users to stay in the queue even if they have a number. At the same time, how to accurately identify abnormal users and add them to the slow queue is also a difficulty in actual situations. Therefore, there is a problem that the prevention effect of malicious registration is limited, which is the problem targeted by this application.

[0040] Then, in Figure 1 Based on a processing logic diagram of a double random slow queue processing scheme of the hospital appointment registration system of the present application, refer to Figure 2 , Figure 2 A schematic flow chart of a double random slow queue processing method for a hospital appointment registration system of the present application is shown. The double random slow queue processing method for a hospital appointment registration system provided by the present application may specifically include the following steps S201 to S205:

[0041] Step S201, for a target number source, within a delay time preset to m seconds after the number is released, obtaining a first appointment registration request, wherein the number of requests for the first appointment registration request is multiple, and the number limit of the first appointment registration request is set to t;

[0042] Among them, for the convenience of explaining the application scheme, this application records the number source processed by the current initiating scheme as the target number source, such as the number source involved in a certain doctor's consultation arrangement on a certain day (the hospital's number source is usually updated and released on a daily basis). Similarly, in order to improve the distinctiveness, the appointment registration requests and queues involved in different situations are distinguished by prefixes such as "first" and "second".

[0043] It can be understood that the improvement goal of the slow queue of the hospital appointment registration system focused on in this application specifically involves a period of time starting from the time the number is released. This period of time is also a typical period of time when "number dealers (scalpers)" are active in malicious registration. At the same time, the delay time is also set similarly to the prior art, with the aim of eliminating malicious registration requests / abnormal users as much as possible within this period of time.

[0044] During the delay time of m seconds, it can be understood that the system can receive appointment registration requests from the same source or different sources. It should be noted that the present application introduces the setting of request limit in this processing link. The request limit is the highest number of appointment registration requests within the delay time period. The actual number of requests is usually larger than the request limit. If requests of the requested limit number (i.e., t requests) are obtained, it can be directly prompted that the appointment is full, thereby further reducing the probability of abnormal users successfully making appointments (white selections). The specific value t can be adjusted under actual circumstances.

[0045] As an exemplary embodiment here, the request source of the first appointment registration request may specifically include a hospital app, a hospital telephone, a hospital's on-site self-host, a third-party cooperative organization, and an online appointment platform. The online appointment platform may include a public account, a life account, and a mini program.

[0046] It can be understood that this is the request source that may be involved in the first appointment registration request of the present application scheme, and a specific implementation scheme is provided (the same applies to the subsequent third appointment registration request).

[0047] In addition, as another exemplary embodiment here, the target number source can specifically be the number source of a designated department or a designated doctor. That is to say, which number sources are used to execute the present application solution can be configured by manual related selection operations, rather than all number sources executing the present application solution by default. In actual applications, the solution is more flexible and can meet the complex and changeable user needs in actual situations.

[0048] Alternatively, the target number source can specifically be a number source determined to be a popular department or a popular doctor. It is easy to understand that this setting involves the system's monitoring of the appointment registration status of the number sources involved in each department or each doctor. If there are no numbers immediately after the number is released or the number source runs out of numbers very quickly, the number source involved can be dynamically updated to a popular number source, thereby automatically triggering the present application scheme. This is obviously more efficient in terms of dynamically updating whether the number source of a specific department or a specific doctor is to be executed in accordance with the present application scheme.

[0049] Step S202: According to the preset first random extraction algorithm, a second appointment registration request is randomly extracted from the first appointment registration request and enters the first queue, wherein the number of the second appointment registration request is multiple, and within the preset delay time of m seconds after the number is released, after the requests in the first queue are processed, a new request is randomly extracted from the updated first appointment registration request for processing until all the target number sources are booked;

[0050] It is understandable that, according to conventional thinking, when the first appointment registration request is obtained within the delay time of m seconds, the users behind these requests will be screened within the delay time of m seconds to see whether they are normal users or abnormal users.

[0051] However, compared to the prior art where the request source is all the appointment registration requests within the deadline, the present application continues to introduce a queuing mechanism and a request random extraction mechanism. By randomly extracting the second appointment registration request from the first appointment registration request obtained previously, and adding it to the first queuing queue for subsequent processing, the probability of abnormal users successfully making an appointment (white selection) can be further reduced.

[0052] Correspondingly, the number of requests in the first queue is random. In different rounds of solution processing, the number of requests in the first queue may vary.

[0053] The random sampling algorithm involved in the random sampling request process can be flexibly configured. For example, the specific number of extractions can be directly and randomly determined. For example, the random sampling processing of requests initiated according to a preset extraction frequency can be randomly stopped. The specific content of the random sampling algorithm is not specifically limited in this application. The request extraction result can meet the requirements as long as it has a random nature.

[0054] In addition, it is understandable that for the requests involved in the currently randomly constructed first queue, after the subsequent screening and processing of normal users and abnormal users, the users who can make a number normally may not necessarily reach the upper limit of the target number source (number source quantity), that is, the target number source may not be fully booked in this round of reservation requests, so new requests need to be arranged to enter a new round of screening and processing of normal users and abnormal users. For this, a new round of random extraction and processing of the second reservation and registration requests needs to be carried out in the first reservation and registration requests obtained previously to complete the update of the requests involved in the first queue, and so on, for a cycle.

[0055] Step S203, based on the user behaviors corresponding to the second appointment registration requests in the first queue, screening out normal users and abnormal users among the users corresponding to the second appointment registration requests;

[0056] It has been made clear from the introduction of step S202 above that, after determining the first queue consisting of the second appointment registration requests obtained by random sampling, screening processing (or judgment processing) of normal users and abnormal users can be carried out on these requests. In this link, it is easy to understand that it is based on the user behavior of the user behind the request. For abnormal users, their user behavior will obviously appear complex operation behavior different from the simple operation behavior of normal users in appointment registration operations due to malicious registration behavior. In this way, the difference between the two types of user behaviors can be combined to complete the judgment of whether the user behind the request is a normal user or an abnormal user.

[0057] As an exemplary embodiment here, based on the user behaviors corresponding to the second appointment registration requests in the first queue, screening out normal users and abnormal users among the users corresponding to the second appointment registration requests may specifically include:

[0058] Based on the judgment rules such as whether the request carries an illegal IP address, whether there are multiple requests from different users in the same IP segment, whether there are multiple requests from the same user with different IP addresses, whether the number of times the reservation verification code is obtained by the reservation mobile phone number reaches the daily limit and whether the user belongs to a user with no operation traces, normal users and abnormal users among the users corresponding to the second reservation registration request are screened out.

[0059] Obviously, if the request carries an illegal IP (source IP and / or destination IP) included in the illegal IP database, or multiple requests from different users appear in the same IP segment of the request, or there are multiple requests from users with different IPs behind the request, the number of times the corresponding appointment mobile phone number is requested to obtain the appointment verification code reaches the daily limit, or the user behind the request is a user with no operation traces,... such requests will be judged as abnormal users, that is, users who brush numbers.

[0060] It can be understood that the embodiment here provides a specific implementation plan for how to screen whether the user behind the appointment registration request is a normal user or an abnormal user.

[0061] Obviously, differentiated processing is required for the two types of users selected, so as to provide normal users with a channel to make an appointment as soon as possible. This can be achieved through subsequent steps S204 and S205.

[0062] Step S204: For normal user requests, normal appointment registration processing is performed;

[0063] It can be understood that the normal appointment registration processing involved here, in layman's terms, is to allow normal users to determine the specific appointment registration content of the target number source (doctor, time, etc.) and complete the payment of the registration fee within the specified time, so that an appointment registration can be successfully processed.

[0064] In this regard, as an exemplary embodiment here, the normal appointment registration process may specifically include the following processing contents:

[0065] For the current user, lock a number source (among the target number sources);

[0066] Initiate payment processing;

[0067] If the payment is completed within 15 minutes, the appointment registration is successfully completed;

[0068] If the payment is not completed within 15 minutes, the number locked for the current user will be released.

[0069] Among them, the normal appointment registration processing arranged by each normal user can correspond to the order in which users are screened / judged as normal users in terms of processing order, that is, whoever is determined as a normal user first can trigger the normal appointment registration processing first until there is no appointment registration number source.

[0070] If the target number source is full, obviously, the first appointment registration request, the second appointment registration request and the first queuing queue can be released based on the recorded appointment registration information.

[0071] As an example, the reservation registration information of a successfully completed reservation registration can be written into the Hospital Information System (HIS), corresponding to an application situation in which the medical institution reservation registration platform generally manages the number source through the HIS.

[0072] Step S205: For requests from abnormal users, queue them up until the delay time is over and perform normal appointment registration processing.

[0073] It can be understood that the second appointment registration request that is screened / determined to be initiated by an abnormal user within the delay time of m seconds needs to continue waiting in the remaining time until the delay time is over before normal appointment registration processing can be carried out.

[0074] In other words, the request priority of abnormal users is lower than that of normal users. They need to compete for the remaining number sources (the number may be empty) after a delay of m seconds through new allocation processing with the users behind them who have not been included in the first appointment registration request and have not been randomly selected as the second appointment registration request. In this way, under this multi-layer screening mechanism, the possibility of users who swipe numbers to successfully make appointments (white selection) can be compressed as much as possible, the slow queuing mechanism of hospital appointment registration can be improved, the convenience and fairness of medical services can be taken into account, and malicious number swiping behavior can be effectively combated / prevented.

[0075] from Figure 2 It can be seen from the illustrated embodiments that, in order to improve the slow queueing of the hospital appointment registration system, the present application forms a double random slow queue processing architecture by combining the queue mechanism and the request random extraction mechanism, thereby effectively limiting the malicious registration behavior and the reversal of number registration behaviors, and ensuring that normal patients can successfully make appointments and registrations, thereby effectively promoting the utilization rate of number sources, improving the efficiency of patient appointments and medical treatment, and improving the patient's medical experience.

[0076] In addition, the present application may also involve the stage of cancellation and subsequent replacement. For this, it can still be combined with the existing slow queue processing scheme of the hospital appointment registration system to better introduce the double random slow queue processing method of the hospital appointment registration system provided by this application.

[0077] For the slow queue processing solution of the existing hospital appointment registration system, when a user cancels his appointment, the system immediately releases and displays the number for users to make appointments. Malicious number-swiping users will take advantage of this feature and continue to swipe numbers, which significantly reduces the possibility of normal users getting an appointment through subsequent appointments.

[0078] In this regard, this application can be set to not display the number source of the canceled reservation to the outside world when it enters the independent number pool of standby reservation. On the one hand, it can effectively avoid being noticed by users who are swiping numbers. On the other hand, it can continue the corresponding substitute algorithm to achieve a fairer number source substitute processing, so as to better ensure that normal users can get a number through the substitute channel.

[0079] For this, see Figure 3 Another processing logic diagram of the double random slow queuing processing scheme of the hospital appointment registration system of the present application is shown. As an exemplary embodiment, in the case where the number source for canceling the appointment is not publicly displayed, after a delay time preset to m seconds after the number is released, before 0:00 on the day of the consultation, the double random slow queuing processing method of the hospital appointment registration system of the present application may also include:

[0080] Obtain different third-party appointment registration requests, wherein the different third-party appointment registration requests are requests for post-registration and after payment, the number of requests for different third-party appointment registration requests is multiple, and the request limit number of different third-party appointment registration requests is set to u;

[0081] According to a preset second random selection algorithm, a fourth appointment registration request is randomly selected from different third appointment registration requests and enters the second queue, wherein the number of the third appointment registration requests is multiple;

[0082] For the corresponding user of the third appointment registration request in the second queue, the status is updated to successful appointment registration.

[0083] The source range of the third appointment registration request here is the same as the source range of the first appointment registration request.

[0084] Here, the second random extraction algorithm and the first random extraction algorithm may involve the same random algorithm or different random algorithms, as long as the results meet the random characteristics.

[0085] It can be understood that in the stage of cancellation and replacement, the user needs to pay the fee first when initiating a replacement request (third appointment registration request). If there is a number that can be allocated later and it is determined through a double-layer screening mechanism that a number can be allocated, the request status can be directly updated to successful appointment registration. On the contrary, if there is no allocation / replacement later, the user does not need to apply for a refund and the refund can be made automatically.

[0086] In addition, for the above plan content, it can also be understood that whether it is a successful appointment registration or an unsuccessful appointment registration (i.e., the appointment registration fails), corresponding prompt information can be displayed to prompt the appointment registration result, and users who have successfully registered for an appointment can be prompted to remind them to see the doctor on time.

[0087] It can be understood that in the setting here, with respect to the first-come, first-served principle of the substitute queue adopted in the prior art, the present application randomly selects users from the substitute queue for substitute processing, combined with the original setting of requesting limited numbers, the same as before, which plays a role in further reducing the probability of abnormal users successfully making appointments (white selection).

[0088] In addition, in combination with the embodiments here, it can also be seen that the appointment registration link in the previous delay time and the withdrawal and replacement link here have formed a random slow queuing effect. In this regard, the slow queuing processing of the hospital appointment registration system provided by itself can also be called double random slow queuing processing, forming a complete and closed malicious number-brushing prevention system.

[0089] In addition, in terms of details, as an exemplary embodiment, for different number sources including the target number source, the adapted t (the requested number limit of the first appointment registration request) and u (the requested number limit of the third appointment registration request) are different.

[0090] It should be noted that this does not mean that t and u are different, but that t and u can be different between different signal sources.

[0091] That is to say, when implementing the present application, the specific number limit for each department or doctor can be set separately, so that the present application can be further flexibly applied in actual situations, so that the slow queuing effect can be more in line with the actual situation of the specific number source.

[0092] As an example, focusing on the appointment stage before the cancellation and replacement stage, expert 1 may have 30 numbers available on a certain day, and the corresponding number limit for the requested number source may be 100; expert 2 may have 15 numbers available on a certain day, and the corresponding number limit for the requested number source may be 80; expert 3 may have 20 numbers available on a certain day, and the corresponding number limit for the requested number source may be 130.

[0093] From the example here, it can be seen that, among different number sources, the number of number limit requests may not show a stable scaling relationship with the number of number sources, nor may it show a positive correlation with the number of number sources. This can be adjusted according to actual conditions.

[0094] The above is an introduction to the double random slow queuing processing method for the hospital appointment registration system provided by this application. In order to facilitate better implementation of the double random slow queuing processing method for the hospital appointment registration system provided by this application, this application also provides a double random slow queuing processing device for a hospital appointment registration system from the perspective of functional modules.

[0095] See also Figure 4 , Figure 4 This is a structural diagram of a double random slow queue processing device of the hospital appointment registration system of the present application. In the present application, the double random slow queue processing device 400 of the hospital appointment registration system may specifically include the following structure:

[0096] The acquisition unit 401 is used to acquire a first appointment registration request for a target number source within a delay time preset to m seconds after the number is released, wherein the number of requests for the first appointment registration request is multiple, and the number limit of the first appointment registration request is set to t;

[0097] The extraction unit 402 is used to randomly extract the second appointment registration request from the first appointment registration request according to the preset first random extraction algorithm, and enter the second appointment registration request into the first queue, wherein the number of the second appointment registration request is multiple, and within the preset delay time of m seconds after the number is released, after the requests in the first queue are processed, a new request is randomly extracted from the updated first appointment registration request for processing until all the target number sources are booked;

[0098] A screening unit 403 is used to screen out normal users and abnormal users among users corresponding to the second appointment registration requests based on user behaviors corresponding to the second appointment registration requests in the first queue;

[0099] The registration unit 404 is used to perform normal reservation registration processing for normal user requests;

[0100] The registration unit 404 is also used to queue up the requests of abnormal users until the delay time ends and perform normal appointment registration processing.

[0101] In an exemplary embodiment, for a target number source, in the case where the number source for canceled appointments is not publicly displayed, after a delay time preset to m seconds after the number is released and before 0:00 on the day of the consultation, the acquisition unit 401 is further used to acquire different third appointment registration requests, wherein the different third appointment registration requests are requests of a supplementary registration nature and after payment, the number of requests for the different third appointment registration requests is multiple, and the number limit of the different third appointment registration requests is set to u;

[0102] The extraction unit 402 is further configured to randomly extract a fourth appointment registration request from different third appointment registration requests according to a preset second random extraction algorithm and enter the fourth appointment registration request into the second queue, wherein the number of the third appointment registration requests is multiple;

[0103] The device also includes:

[0104] The updating unit 405 is used to update the status of the corresponding user of the third appointment registration request in the second queue to a successful appointment registration.

[0105] In another exemplary embodiment, the request sources of the first appointment registration request and the third appointment registration request specifically include hospital app, hospital telephone, hospital on-site self-host, third-party cooperation agency and online appointment platform, and the online appointment platform includes official account, life account and mini program.

[0106] In yet another exemplary embodiment, for different signal sources including the target signal source, the adapted t and u are different.

[0107] In another exemplary embodiment, the screening unit 403 is specifically configured to:

[0108] Based on the judgment rules of whether the request carries an illegal IP address, whether there are multiple requests from different users in the same IP segment, whether there are multiple requests from the same user with different IP addresses, whether the number of times the reservation verification code is obtained by the reservation mobile phone number reaches the daily limit, and whether the user belongs to a user with no operation traces, normal users and abnormal users among the users corresponding to the second reservation registration request are screened out.

[0109] In another exemplary embodiment, the normal appointment registration process includes the following processing contents:

[0110] For the current user, lock a number source;

[0111] Initiate payment processing;

[0112] If the payment is completed within 15 minutes, the appointment registration is successfully completed;

[0113] If the payment is not completed within 15 minutes, the number locked for the current user will be released.

[0114] In another exemplary embodiment, the target number source is specifically a number source of a designated department or a designated doctor;

[0115] Alternatively, the target number source is specifically a number source determined to be a popular department or a popular doctor.

[0116] The present application also provides a processing device from the perspective of hardware structure, which is equipped with the hospital appointment registration system (or hospital appointment registration platform) involved in the present application, and can also be equivalent to the hospital appointment registration system (or hospital appointment registration platform) involved in the application, see Figure 5 , Figure 5 501, a memory 502, and an input / output device 503. The processor 501 is used to execute the computer program stored in the memory 502 to implement the following Figure 2 The steps of the double random slow queuing processing method of the hospital appointment registration system in the corresponding embodiment; or, the processor 501 is used to execute the computer program stored in the memory 502 to implement the following Figure 4 Corresponding to the functions of each unit in the embodiment, the memory 502 is used to store the processor 501 executing the above Figure 2 The computer program required for the double random slow queuing processing method of the hospital appointment registration system in the corresponding embodiment.

[0117] Exemplarily, the computer program may be divided into one or more modules / units, one or more modules / units are stored in the memory 502, and executed by the processor 501 to complete the present application. One or more modules / units may be a series of computer program instruction segments capable of completing specific functions, and the instruction segments are used to describe the execution process of the computer program in the computer device.

[0118] The processing device may include, but is not limited to, a processor 501, a memory 502, and an input / output device 503. Those skilled in the art will appreciate that the illustration is merely an example of a processing device and does not constitute a limitation on the processing device, and may include more or fewer components than shown in the illustration, or a combination of certain components, or different components. For example, the processing device may also include a network access device, a bus, etc., and the processor 501, the memory 502, the input / output device 503, etc. are connected via a bus.

[0119] The processor 501 may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc. The processor is the control center of the processing device, and uses various interfaces and lines to connect various parts of the entire device.

[0120] The memory 502 can be used to store computer programs and / or modules. The processor 501 implements various functions of the computer device by running or executing the computer programs and / or modules stored in the memory 502 and calling the data stored in the memory 502. The memory 502 can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, at least one application required for a function, etc.; the data storage area can store data created according to the use of the processing device, etc. In addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (SecureDigital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage devices.

[0121] When the processor 501 is used to execute the computer program stored in the memory 502, the following functions can be implemented:

[0122] For the target number source, within a delay time preset to m seconds after the number is released, a first appointment registration request is obtained, wherein the number of requests for the first appointment registration request is multiple, and the number limit of the first appointment registration request is set to t;

[0123] According to the preset first random extraction algorithm, the second appointment registration request is randomly extracted from the first appointment registration request and enters the first queuing queue, wherein the number of the second appointment registration request is multiple, and within the preset delay time of m seconds after the number is released, after the requests in the first queuing queue are processed, new requests are randomly extracted from the updated first appointment registration request for processing until all the target number sources are booked;

[0124] Based on the user behaviors corresponding to the second appointment registration requests in the first queue, normal users and abnormal users among the users corresponding to the second appointment registration requests are screened out;

[0125] For normal user requests, normal appointment registration processing will be carried out;

[0126] For requests from abnormal users, they will be queued until the delay time ends and then processed as normal appointments.

[0127] Those skilled in the art can clearly understand that for the convenience and simplicity of description, the specific working process of the double random slow queue processing device, processing equipment and corresponding units of the hospital appointment registration system described above can refer to the following. Figure 2 The description of the double random slow queuing processing method of the hospital appointment registration system in the corresponding embodiment will not be repeated here.

[0128] A person of ordinary skill in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be completed by instructions, or by controlling related hardware through instructions. The instructions may be stored in a computer-readable storage medium and loaded and executed by a processor.

[0129] To this end, the present application provides a computer-readable storage medium, in which a plurality of instructions are stored, and the instructions can be loaded by a processor to execute the present application as follows: Figure 2 The steps of the double random slow queuing processing method of the hospital appointment registration system in the corresponding embodiment, the specific operation can be referred to as follows Figure 2 The description of the double random slow queuing processing method of the hospital appointment registration system in the corresponding embodiment will not be repeated here.

[0130] The computer-readable storage medium may include: a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.

[0131] Due to the instructions stored in the computer-readable storage medium, the present application can be executed. Figure 2 The steps of the double random slow queuing processing method of the hospital appointment registration system in the corresponding embodiment, therefore, the present application can be implemented as follows Figure 2 The beneficial effects that can be achieved by the double random slow queuing processing method for the hospital appointment registration system in the corresponding embodiment are detailed in the previous description and will not be repeated here.

[0132] The double random slow queuing processing method, device, processing equipment and computer-readable storage medium of the hospital appointment registration system provided by the present application are introduced in detail above. Specific examples are used in this article to illustrate the principles and implementation methods of the present application. The description of the above embodiments is only used to help understand the method of the present application and its core idea; at the same time, for technical personnel in this field, according to the idea of ​​the present application, there will be changes in the specific implementation method and application scope. In summary, the content of this specification should not be understood as a limitation on the present application.

Claims

1. A double random slow queue processing method for a hospital appointment registration system, characterized in that: The method comprises: For the target number source, within a delay time preset to m seconds after the number is released, a first appointment registration request is obtained, wherein the number of requests for the first appointment registration request is multiple, and the number limit of the first appointment registration request is set to t; According to a preset first random extraction algorithm, a second reservation registration request is randomly extracted from the first reservation registration request and enters the first queuing queue, wherein the number of the second reservation registration request is multiple, and within the preset delay time of m seconds after the number is released, after the requests in the first queuing queue are processed, a new request is randomly extracted from the updated first reservation registration request for processing until all the target number sources are booked; Based on the user behaviors corresponding to the second appointment registration requests in the first queue, screening out normal users and abnormal users among the users corresponding to the second appointment registration requests; For the request of the normal user, perform normal appointment registration processing; For the request of the abnormal user, the user is queued until the delay time is over and the normal appointment registration process is performed.

2. The method according to claim 1, characterized in that: For the target number source, when the number source for canceled appointments is not publicly displayed, after the delay time preset to m seconds after the number is released and before 0:00 on the day of the consultation, the method further includes: Obtaining different third appointment registration requests, wherein the different third appointment registration requests are requests of a later-supplement registration nature and after payment, the number of requests for the different third appointment registration requests is multiple, and the request limit number for the different third appointment registration requests is set to u; According to a preset second random selection algorithm, randomly select a fourth appointment registration request from the different third appointment registration requests and enter the second queue, wherein the number of the third appointment registration requests is multiple; For the user corresponding to the third appointment registration request in the second queuing queue, the status is updated to successful appointment registration.

3. The method according to claim 2, characterized in that The request sources of the first appointment registration request and the third appointment registration request specifically include hospital app, hospital telephone, hospital on-site self-host, third-party cooperation agency and online appointment platform, and the online appointment platform includes official account, life account and mini program.

4. The method according to claim 2, characterized in that: For different signal sources including the target signal source, the adapted t and u are different.

5. The method according to claim 1, characterized in that The filtering out normal users and abnormal users among users corresponding to the second appointment registration requests based on user behaviors corresponding to the second appointment registration requests in the first queue includes: Based on the judgment rules of whether the request carries an illegal IP, whether there are multiple requests from different users in the same IP segment, whether there are multiple requests from the same user with different IPs, whether the number of times the reservation verification code is obtained by the reservation mobile phone number reaches the daily limit and whether the user belongs to a user with no operation traces, the normal users and the abnormal users among the users corresponding to the second reservation registration request are screened out.

6. The method according to claim 1, characterized in that The normal appointment registration process includes the following processing contents: For the current user, lock a number source; Initiate payment processing; If the payment is completed within 15 minutes, the appointment registration is successfully completed; If the payment is not completed within 15 minutes, the number source locked for the current user will be released.

7. The method according to claim 1, characterized in that The target number source is specifically the number source of a designated department or a designated doctor; Alternatively, the target number source is specifically a number source determined to be a popular department or a popular doctor.

8. A double random slow queue processing device for a hospital appointment registration system, characterized in that: The device comprises: An acquisition unit is used to acquire a first appointment registration request for a target number source within a delay time preset to m seconds after the number is released, wherein the number of requests for the first appointment registration request is multiple, and the number limit of the first appointment registration request is set to t; The extraction unit is used to randomly extract the second appointment registration request from the first appointment registration request according to a preset first random extraction algorithm, and enter the second appointment registration request into the first queue, wherein the number of the second appointment registration request is multiple, and within the delay time preset as m seconds after the number is released, after the requests in the first queue are processed, a new request is randomly extracted from the updated first appointment registration request for processing until all the target number sources are booked; A screening unit, configured to screen out normal users and abnormal users among users corresponding to the second appointment registration requests based on user behaviors corresponding to the second appointment registration requests in the first queue; A registration unit, used for performing normal reservation registration processing for the request of the normal user; The registration unit is also used to queue the request of the abnormal user until the delay time ends and perform the normal appointment registration process.

9. A processing device, characterized in that: The method comprises a processor and a memory, wherein the memory stores a computer program, and the processor executes the method according to any one of claims 1 to 7 when calling the computer program in the memory.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a plurality of instructions, and the instructions are suitable for being loaded by a processor to execute the method according to any one of claims 1 to 7.

Images