CN109934987B - Intelligent transfer queuing method and device - Google Patents
Intelligent transfer queuing method and device Download PDFInfo
- Publication number
- CN109934987B CN109934987B CN201910235028.6A CN201910235028A CN109934987B CN 109934987 B CN109934987 B CN 109934987B CN 201910235028 A CN201910235028 A CN 201910235028A CN 109934987 B CN109934987 B CN 109934987B
- Authority
- CN
- China
- Prior art keywords
- client
- target
- window
- waiting queue
- alternative
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H40/00—ICT specially adapted for the management or administration of healthcare resources or facilities; ICT specially adapted for the management or operation of medical equipment or devices
- G16H40/20—ICT specially adapted for the management or administration of healthcare resources or facilities; ICT specially adapted for the management or operation of medical equipment or devices for the management or administration of healthcare resources or facilities, e.g. managing hospital staff or surgery rooms
Abstract
The invention provides an intelligent transfer queuing method and device. Relates to the technical field of internet. The intelligent transfer queuing method comprises the following steps: and if the current number of the number-taking of the target window exceeds a preset threshold value, determining whether a target client meeting the transfer condition exists in the waiting queue of the target window according to the client number-taking information in the waiting queue of the target window and the client number-taking information in the waiting queue of the alternative window. Wherein the service content of the alternative window comprises the service request content of the target client. And if the target window waiting queue has the target clients meeting the transfer conditions, transferring the target clients to the alternative window waiting queue. The intelligent transfer queuing method can realize that the client who queues first transacts the business first, and can share the pressure of the target window, and has the advantage of transacting the business for more clients in the same time period.
Description
Technical Field
The invention relates to the technical field of internet, in particular to an intelligent transfer queuing method and device.
Background
With the development of informatization and intellectualization of the current society, the requirements on the work efficiency and the environment of each industry are higher and higher, and particularly the service industry needs to meet the business service requirements of the served people and also provides high-level work environment, service quality and efficiency. For example, in outpatient service of hospitals, patients at present need hospitals to meet the requirements of businesses, and need hospitals to improve the hospitalizing environment and the hospitalizing order as much as possible.
When seeing a doctor and seeing a doctor, the hospital adopts the queuing management system of seeing a doctor, according to the flow number of getting, waiting, calling out, according to the pronunciation call and the suggestion of display screen go to corresponding consulting room in order and see a doctor, can effectively alleviate the anxious mood of patient and family members, also build quiet, orderly environment of seeing a doctor simultaneously.
In the process, the maximum treatment amount of each consulting room per day is constant, and when a large number of patients exist in a certain day, the number limitation mode can be adopted, but the maximum treatment amount of the patients is limited to a certain extent, so that inconvenience is brought to the patients who take urgent treatment on the same day.
Disclosure of Invention
The invention aims to provide an intelligent queuing method and device aiming at the defects in the prior art, so as to solve the problem that the intelligent transfer cannot be realized during registration and queuing of a consulting room in the prior art.
In order to achieve the above purpose, the embodiment of the present invention adopts the following technical solutions:
in a first aspect, an embodiment of the present invention provides an intelligent transfer queuing method, including:
if the current number of number taking of the target window exceeds a preset threshold value, determining whether a target client meeting a transfer condition exists in the target window waiting queue according to client number taking information in the target window waiting queue and client number taking information in an alternative window waiting queue, wherein the client number taking information comprises: client identification, service request content, number taking time and pre-allocated target window identification; the service content of the alternative window comprises the service request content of the target client;
and if the target window waiting queue has the target client meeting the transfer condition, transferring the target client to the alternative window waiting queue.
Optionally, the determining, according to the client number-taking information in the target window waiting queue and the client number-taking information in the alternative window waiting queue, whether a target client meeting a transfer condition exists in the target window waiting queue includes:
obtaining the number taking time of the sequential first client in the target window waiting queue and the number taking time of the sequential first client in the alternative window waiting queue;
and if the number taking time of the first client in the sequence in the target window waiting queue is earlier than the number taking time of the first client in the sequence in the alternative window waiting queue, determining the first client in the sequence in the target window waiting queue as the target client.
Optionally, when there are a plurality of candidate windows, if the number fetching time of the sequential first client in the target window waiting queue is earlier than the number fetching time of the sequential first client in the candidate window waiting queue, determining that the sequential first client in the target window waiting queue is the target client, including:
comparing the number taking time of the sequential first client in the target window waiting queue with the number taking time of the sequential first client in each alternative window waiting queue in sequence to obtain a target alternative window, wherein the number taking time of the sequential first client in the target alternative window waiting queue is later than the number taking time of the sequential first client in the target window waiting queue;
and determining that the first client in the target window waiting queue is the target client switched to the target alternative window.
Optionally, the comparing the number taking time of the sequential first client in the target window waiting queue with the number taking time of the sequential first client in each alternative window waiting queue in sequence to obtain the target alternative window includes:
and if the number taking time of the first client in the sequence in the standby queues of the multiple candidate windows is later than the number taking time of the first client in the sequence in the standby queues of the target windows, selecting one target candidate window from the multiple candidate windows according to a preset rule.
Optionally, the selecting a target candidate window from the multiple candidate windows according to a preset rule includes:
and selecting a target candidate window from the plurality of candidate windows according to the number sequence or the priority sequence of the plurality of candidate windows.
In a second aspect, an embodiment of the present invention further provides an intelligent transfer queuing apparatus, including:
a determining module, configured to determine whether a target client meeting a transfer condition exists in the target window waiting queue according to client number taking information in the target window waiting queue and client number taking information in an alternative window waiting queue if a current number of number taking of the target window exceeds a preset threshold, where the client number taking information includes: client identification, service request content, number taking time and pre-allocated target window identification; the service content of the alternative window comprises the service request content of the target client;
and the transfer module is used for transferring the target client to the alternative window waiting queue if the target client meeting the transfer condition exists in the target window waiting queue.
Optionally, the determining module is specifically configured to obtain the number taking time of the sequential first client in the target window waiting queue and the number taking time of the sequential first client in the alternative window waiting queue; and if the number taking time of the first client in the sequence in the target window waiting queue is earlier than the number taking time of the first client in the sequence in the alternative window waiting queue, determining the first client in the sequence in the target window waiting queue as the target client.
Optionally, the determining module is specifically configured to compare the number taking time of the sequential first client in the target window waiting queue with the number taking time of the sequential first client in each alternative window waiting queue in sequence, and obtain a target alternative window, where the number taking time of the sequential first client in the target alternative window waiting queue is later than the number taking time of the sequential first client in the target window waiting queue; and determining that the first client in the target window waiting queue is the target client switched to the target alternative window.
Optionally, the determining module is specifically configured to select one target candidate window from the multiple candidate windows according to a preset rule if the number taking time of the sequential first client in the multiple candidate window waiting queues is later than the number taking time of the sequential first client in the target window waiting queue.
Optionally, the determining module is specifically configured to select one target candidate window from the multiple candidate windows according to the number order or the priority order of the multiple candidate windows.
The invention has the beneficial effects that:
the invention provides an intelligent transfer queuing method and device, wherein the method comprises the following steps: firstly, judging whether the current number of number taking of a target window exceeds a preset threshold value, if so, determining whether a target client meeting a transfer condition exists in the target window waiting queue according to client number taking information in the target window waiting queue and client number taking information in an alternative window waiting queue; and if the target client meeting the transfer condition exists, transferring the target client to the alternative window waiting queue. Meanwhile, the service content of the alternative window contains the service request content of the target client. The intelligent transfer queuing method can realize that the client who queues first transacts the business first, and can share the pressure of the target window, and has the advantage of transacting the business for more clients in the same time period.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.
Fig. 1 is a schematic flowchart of an intelligent transfer queuing method according to an embodiment of the present application;
fig. 2 is a schematic flowchart of an intelligent transfer queuing method according to another embodiment of the present application;
fig. 3 is a schematic flowchart of an intelligent transfer queuing method according to another embodiment of the present application;
fig. 4 is a schematic structural diagram of an intelligent transfer queuing apparatus according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of an intelligent transfer queuing apparatus according to another embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention.
Fig. 1 is a schematic flowchart of an intelligent transfer queuing method according to an embodiment of the present application; as shown in fig. 1, the intelligent transfer queuing method includes:
s110: and if the current number of the number-taking of the target window exceeds a preset threshold value, determining whether a target client meeting the transfer condition exists in the waiting queue of the target window according to the client number-taking information in the waiting queue of the target window and the client number-taking information in the waiting queue of the alternative window.
Wherein, the client number-taking information comprises: client identification, service request content, number taking time and pre-allocated target window identification. The service content of the alternative window contains the service request content of the target client.
The client identifier is a number, and the service request content indicates the service content that the client needs to handle, for example: on the hospital side, the service request content may be: the department that the patient needs to register, the consulting room that needs to do the inspection. In the banking service industry, the service request content may be: actual business contents that need to be handled, etc., and the embodiment is not limited herein.
And when the number is taken by a client, the system automatically acquires the number. The pre-allocated target window identifier indicates that when the transfer condition is met, the target client needs to be transferred to the corresponding alternative window, the service content of the corresponding alternative window needs to be known, and the service content of the alternative window needs to include the service requirement of the target client.
S120: and if the target window waiting queue has the target client meeting the transfer condition, transferring the target client to the alternative window waiting queue.
The above transfer condition needs to satisfy four conditions: firstly, the system needs to count the current number taking quantity of a target window, and starts to prepare for transfer when the current number taking quantity exceeds a preset threshold value. And secondly, transferring according to the time priority during queuing, which means that in the current queuing waiting sequence, transferring the client with the earlier number taking time, namely the first client in the waiting sequence, as the target client. And thirdly, judging whether the service request content of the target client corresponds to the service content of the alternative window or not, and when the service request content of the target client corresponds to the service content of the alternative window, pre-transferring the target client to the alternative window by the system. And fourthly, judging the number taking time of the target client and the first client in the standby sequence of the alternative window, and if the number taking time of the target client is earlier than that of the first client in the standby sequence of the alternative window, transferring the target client to the first client of the standby sequence of the alternative window.
The intelligent queuing and transferring method provided by the embodiment comprises the following steps: and judging whether the current number of the number-taking of the target window exceeds a preset threshold value, if so, determining whether a target client meeting the transfer condition exists in the waiting queue of the target window according to the client number-taking information in the waiting queue of the target window and the client number-taking information in the waiting queue of the alternative window. And if the target client meeting the transfer condition exists, transferring the target client to the alternative window waiting queue. Meanwhile, the service content of the alternative window contains the service request content of the target client. The intelligent transfer queuing method can realize that the client who queues first transacts the business first, and can share the pressure of the target window, and has the advantage of transacting the business for more clients in the same time period.
Fig. 2 is a schematic flowchart of an intelligent transfer queuing method according to another embodiment of the present application. As shown in fig. 2, the method includes:
s210: and acquiring the number taking time of the first client in the sequence in the waiting queue of the target window and the number taking time of the first client in the sequence in the waiting queue of the alternative window.
And determining whether a target client meeting the transfer condition exists in the target window waiting queue according to the client number taking information in the target window waiting queue and the client number taking information in the alternative window waiting queue, if so, further acquiring the number taking time of the first client in the sequence in the target window waiting queue and the number taking time of the first client in the sequence in the alternative window waiting queue, and executing step S220.
S220: and if the number taking time of the first client in the sequence in the waiting queue of the target window is earlier than that of the first client in the sequence in the waiting queue of the alternative window, determining the first client in the sequence in the waiting queue of the target window as the target client.
Fig. 3 is a schematic flowchart of an intelligent transfer queuing method according to another embodiment of the present application; as shown in fig. 3, the method includes:
s310: and comparing the number taking time of the sequential first client in the target window waiting queue with the number taking time of the sequential first client in each alternative window waiting queue in sequence to obtain the target alternative window, wherein the number taking time of the sequential first client in the target alternative window waiting queue is later than that of the sequential first client in the target window waiting queue.
The window meeting the transition condition in the candidate windows is referred to as a target candidate window, the number taking time of the sequential first client in the target candidate window waiting queue and the number taking time of the sequential first client in the target window waiting queue are further determined, and if the number taking time of the sequential first client in the target window waiting queue is earlier than the number taking time of the sequential first client in the target candidate window waiting queue, step S320 is executed.
S320: and determining that the first client in the waiting queue of the target window is the target client switched to the target alternative window.
And if the number taking time of the first client in the sequence in the target window waiting queue is earlier than that of the first client in the sequence in the target alternative window waiting queue, transferring the first client in the sequence in the target window waiting queue to the target alternative window and becoming the first client in the sequence in the target alternative window waiting queue.
In one embodiment, taking a hospital as an example of examination, if the maximum number of visits per morning in office A is 50, and the examination that office A mainly does is item a, the current number of number-taking in office A has exceeded 50, then the system starts with person 51 to determine whether the first patient in the current waiting sequence can be transferred.
If the number-taking information of the first patient in the current waiting sequence of the current A diagnosis room is A005, then judging whether the candidate diagnosis room B can do the item a, if so, further judging the first patient in the current waiting sequence of the candidate diagnosis room B with the number-taking information of B006 and the number-taking time of A005, if the number-taking time of A005 is earlier than B006, taking A005 as the target client, and transferring A005 to B006, then the next patient in the candidate diagnosis room B for examination will be A005.
In this embodiment, the number-taking time of a005 is later than the number-taking time of B006, and in this case, a005 cannot be transferred and waits until the patient with the number of a005 is examined in the a-ward. And the patient who is currently queued in the first waiting sequence in the a consulting room is a006, and similarly, when the number-taking time of a005 is later than that of B006, the number-taking time of a006 is certainly later than that of B006, at this time, B006 may already enter consulting room B for examination, and then it is necessary to determine the number-taking time of a007 as the number-taking information in the current waiting sequence in a006 and an alternative consulting room B, and the process is the same as above, and is not described herein again.
The embodiment can be seen that when the system judges whether the client can be transferred, the client with the first order of the target window is judged all the time, and the number taking time is compared with the number taking time of the client with the first order after the alternative window is updated.
Optionally, if the number taking time of the sequential first client in the multiple candidate window waiting queues is later than the number taking time of the sequential first client in the target window waiting queue, selecting one target candidate window from the multiple candidate windows according to a preset rule.
For example, when a005 patient in the a clinic is transferred, the multiple candidate windows all satisfy the transfer condition, the transfer is performed according to the preset rule, and one of the multiple candidate windows is selected as the target candidate window.
Further, the preset rule may be that one target candidate window is selected from the multiple candidate windows according to the number order or the priority order of the multiple candidate windows.
In another embodiment, when there are two candidate windows, for example, B, C for each of the two candidate windows, if the first patient in the queuing order of the a-room is to be transferred, it is determined preferentially whether the B-room satisfies the transfer condition, if the B-room satisfies the transfer condition, the first patient in the queuing order of the a-room is transferred to the head of the queuing order of the B-room, and if the B-room satisfies the transfer condition, the first patient in the queuing order of the a-room is transferred to the head of the queuing order of the B-room. If the B diagnosis room does not meet the transfer condition, further judging whether the C diagnosis room meets the transfer condition, and if the C diagnosis room meets the transfer condition, transferring the first patient in the queuing sequence of the A diagnosis room to the first patient in the queuing sequence of the C diagnosis room. By analogy, the number of the specific candidate windows is not limited in this embodiment.
Fig. 4 is a schematic structural diagram of an intelligent transfer queuing apparatus according to an embodiment of the present application. As shown in fig. 4, the apparatus specifically includes: a determination module 401 and a transfer module 402. Wherein the content of the first and second substances,
the determining module 401 is configured to determine, if the current number of number fetches in the target window exceeds a preset threshold, whether a target client meeting the transfer condition exists in the target window waiting queue according to the client number fetching information in the target window waiting queue and the client number fetching information in the alternative window waiting queue.
Wherein, the client number-taking information comprises: client identification, service request content, number taking time and pre-allocated target window identification. The service content of the alternative window comprises the service request content of the target client.
A transferring module 402, configured to transfer the target client to the alternative window waiting queue if there is a target client meeting the transfer condition in the target window waiting queue.
Optionally, the determining module 401 is specifically configured to compare the number taking time of the sequential first client in the target window waiting queue with the number taking time of the sequential first client in each candidate window waiting queue in sequence, and obtain the target candidate window, where the number taking time of the sequential first client in the target candidate window waiting queue is later than the number taking time of the sequential first client in the target window waiting queue. The determining module 401 is further configured to determine that the sequential first client in the waiting queue of the target window is the target client switched to the target alternative window.
Optionally, the determining module 401 is specifically configured to select one target candidate window from the multiple candidate windows according to a preset rule if the number fetching time of the sequential first client in the multiple candidate window waiting queues is later than the number fetching time of the sequential first client in the target window waiting queue.
Optionally, the determining module 401 is specifically configured to select one target candidate window from the multiple candidate windows according to the number order or the priority order of the multiple candidate windows.
The above-mentioned apparatus is used for executing the method provided by the foregoing embodiment, and the implementation principle and technical effect are similar, which are not described herein again.
These modules may be one or more integrated circuits configured to implement the above methods, such as: one or more Application Specific Integrated Circuits (ASICs), or one or more microprocessors (DSPs), or one or more Field Programmable Gate Arrays (FPGAs), among others. For another example, when one of the above modules is implemented in the form of a processing element scheduler code, the processing element may be a general-purpose processor, such as a Central Processing Unit (CPU) or other processor capable of calling program code. For another example, these modules may be integrated together and implemented in the form of a system-on-a-chip (SOC).
Fig. 5 is a schematic structural diagram of an intelligent transfer queuing apparatus according to another embodiment of the present application, where the apparatus may be integrated in a terminal device or a chip of the terminal device, and the terminal may be a computing device.
The device includes: a processor 501 and a memory 502.
The memory 502 is used for storing programs, and the processor 501 calls the programs stored in the memory 502 to execute the above-mentioned method embodiments. The specific implementation and technical effects are similar, and are not described herein again.
Optionally, the invention also provides a program product, for example a computer-readable storage medium, comprising a program which, when being executed by a processor, is adapted to carry out the above-mentioned method embodiments.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device) or a processor (processor) to execute some steps of the methods according to the embodiments of the present invention. And the aforementioned storage medium includes: a U disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
Claims (8)
1. An intelligent transfer queuing method, comprising:
if the current number of number taking of the target window exceeds a preset threshold value, determining whether a target client meeting a transfer condition exists in the target window waiting queue according to client number taking information in the target window waiting queue and client number taking information in an alternative window waiting queue, wherein the client number taking information comprises: client identification, service request content, number taking time and pre-allocated target window identification; the service content of the alternative window comprises the service request content of the target client;
if the target window waiting queue has a target client meeting the transfer condition, transferring the target client to the alternative window waiting queue;
the step of determining whether a target client meeting a transfer condition exists in the target window waiting queue according to the client number taking information in the target window waiting queue and the client number taking information in the alternative window waiting queue includes:
obtaining the number taking time of the sequential first client in the target window waiting queue and the number taking time of the sequential first client in the alternative window waiting queue;
and if the number taking time of the first client in the sequence in the target window waiting queue is earlier than the number taking time of the first client in the sequence in the alternative window waiting queue, determining the first client in the sequence in the target window waiting queue as the target client.
2. The intelligent transfer queuing method of claim 1 wherein, when there are multiple candidate windows, if the number fetch time of the first client in the waiting queue of the target window is earlier than the number fetch time of the first client in the waiting queue of the candidate window, determining that the first client in the waiting queue of the target window is the target client comprises:
comparing the number taking time of the sequential first client in the target window waiting queue with the number taking time of the sequential first client in each alternative window waiting queue in sequence to obtain a target alternative window, wherein the number taking time of the sequential first client in the target alternative window waiting queue is later than the number taking time of the sequential first client in the target window waiting queue;
and determining that the first client in the target window waiting queue is the target client switched to the target alternative window.
3. The intelligent branch queuing method of claim 2 wherein said comparing the number fetching time of the first client in order in the target window waiting queue with the number fetching time of the first client in order in each of the alternative window waiting queues to obtain the target alternative window comprises:
and if the number taking time of the first client in the sequence in the standby queues of the multiple candidate windows is later than the number taking time of the first client in the sequence in the standby queues of the target windows, selecting one target candidate window from the multiple candidate windows according to a preset rule.
4. The intelligent transfer queuing method of claim 3 wherein said selecting a target candidate window among said plurality of candidate windows according to a preset rule comprises:
and selecting a target candidate window from the plurality of candidate windows according to the number sequence or the priority sequence of the plurality of candidate windows.
5. An intelligent transfer queuing apparatus, comprising:
a determining module, configured to determine whether a target client meeting a transfer condition exists in the target window waiting queue according to client number taking information in the target window waiting queue and client number taking information in an alternative window waiting queue if a current number of number taking of the target window exceeds a preset threshold, where the client number taking information includes: client identification, service request content, number taking time and pre-allocated target window identification; the service content of the alternative window comprises the service request content of the target client;
a transfer module, configured to transfer a target client to the alternative window waiting queue if the target client meeting a transfer condition exists in the target window waiting queue;
the determining module is specifically configured to obtain the number taking time of the sequential first client in the target window waiting queue and the number taking time of the sequential first client in the alternative window waiting queue; and if the number taking time of the first client in the sequence in the target window waiting queue is earlier than the number taking time of the first client in the sequence in the alternative window waiting queue, determining the first client in the sequence in the target window waiting queue as the target client.
6. The intelligent transfer queuing apparatus of claim 5, wherein the determining module is specifically configured to compare the number fetching time of a sequential first client in the target window waiting queue with the number fetching time of a sequential first client in each alternative window waiting queue in sequence to obtain a target alternative window, where the number fetching time of a sequential first client in the target alternative window waiting queue is later than the number fetching time of a sequential first client in the target window waiting queue; and determining that the first client in the target window waiting queue is the target client switched to the target alternative window.
7. The intelligent transfer queuing apparatus of claim 6, wherein the determining module is specifically configured to select one target candidate window from the multiple candidate windows according to a preset rule if the number fetching time of a sequential first client in the multiple candidate window waiting queues is later than the number fetching time of the sequential first client in the target window waiting queue.
8. The intelligent transfer queuing apparatus of claim 7, wherein the determining module is specifically configured to select a target candidate window from the multiple candidate windows according to a numbering order or a priority order of the multiple candidate windows.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910235028.6A CN109934987B (en) | 2019-03-26 | 2019-03-26 | Intelligent transfer queuing method and device |
| PCT/CN2019/117636 WO2020192136A1 (en) | 2019-03-26 | 2019-11-12 | Queuing method and device enabling smart transfer |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910235028.6A CN109934987B (en) | 2019-03-26 | 2019-03-26 | Intelligent transfer queuing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109934987A CN109934987A (en) | 2019-06-25 |
| CN109934987B true CN109934987B (en) | 2020-09-04 |
Family
ID=66988412
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910235028.6A Active CN109934987B (en) | 2019-03-26 | 2019-03-26 | Intelligent transfer queuing method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN109934987B (en) |
| WO (1) | WO2020192136A1 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109934987B (en) * | 2019-03-26 | 2020-09-04 | 苏州工业园区东诚智能网络技术有限公司 | Intelligent transfer queuing method and device |
| CN112488626A (en) * | 2020-11-30 | 2021-03-12 | 浙江中控技术股份有限公司 | Material transfer control method and device and electronic equipment |
| CN113177747A (en) * | 2021-06-25 | 2021-07-27 | 南京铉盈网络科技有限公司 | Method and system for allocating single service window of court litigation service hall in cold start |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN201622632U (en) * | 2009-08-25 | 2010-11-03 | 广州市欣瑞电子有限公司 | Queuing system adopting dynamic calling rule |
| CN105678889A (en) * | 2016-03-09 | 2016-06-15 | 苏州工业园区东诚智能网络技术有限公司 | Queuing and calling system |
| CN207424987U (en) * | 2017-05-24 | 2018-05-29 | 南京华设科技股份有限公司 | Intelligent queue system |
| CN108090597A (en) * | 2017-12-29 | 2018-05-29 | 珠海国芯云科技有限公司 | Medical appointment and queuing optimization method and device |
| CN108446837A (en) * | 2018-03-07 | 2018-08-24 | 中国人民大学 | A kind of load optimized method of medical services recommended work |
| CN108520349A (en) * | 2018-03-30 | 2018-09-11 | 深圳市零度智控科技有限公司 | Bank client shunt method and system, storage medium |
| CN109377633A (en) * | 2018-11-26 | 2019-02-22 | 平安科技（深圳）有限公司 | A kind of queue number generation method and terminal device |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101216783A (en) * | 2007-12-29 | 2008-07-09 | 中国建设银行股份有限公司 | Process for optimizing ordering processing for multiple affairs |
| PH12013000351A1 (en) * | 2013-11-22 | 2015-05-25 | Joselle A Macrohon | A versatile queuing management system and method |
| CA2945023A1 (en) * | 2014-04-07 | 2015-10-15 | Cubic Corporation | Systems and methods for queue management |
| CN105046802B (en) * | 2015-07-07 | 2017-09-22 | 浙江维融电子科技股份有限公司 | A kind of bank queuing management method and system based on many sales counters |
| CN106375614A (en) * | 2015-07-20 | 2017-02-01 | 阿里巴巴集团控股有限公司 | Method and apparatus for processing call center business |
| CN105654600B (en) * | 2016-03-02 | 2018-07-06 | 江苏国泰智慧软件股份有限公司 | The number of taking queuing strategy and system |
| CN108259685B (en) * | 2016-12-29 | 2020-11-24 | 中国移动通信集团浙江有限公司 | Call processing method and device |
| CN107958526A (en) * | 2017-11-20 | 2018-04-24 | 中国银行股份有限公司 | One kind is lined up processing method and processing device |
| CN108182752B (en) * | 2017-12-25 | 2021-02-23 | 华中科技大学同济医学院附属协和医院 | Hospital registration queuing auxiliary system and method |
| CN108985477A (en) * | 2018-06-29 | 2018-12-11 | 北京嘀嘀无限科技发展有限公司 | Method for processing business, device and storage medium |
| CN109934987B (en) * | 2019-03-26 | 2020-09-04 | 苏州工业园区东诚智能网络技术有限公司 | Intelligent transfer queuing method and device |
-
2019
- 2019-03-26 CN CN201910235028.6A patent/CN109934987B/en active Active
- 2019-11-12 WO PCT/CN2019/117636 patent/WO2020192136A1/en active Application Filing
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN201622632U (en) * | 2009-08-25 | 2010-11-03 | 广州市欣瑞电子有限公司 | Queuing system adopting dynamic calling rule |
| CN105678889A (en) * | 2016-03-09 | 2016-06-15 | 苏州工业园区东诚智能网络技术有限公司 | Queuing and calling system |
| CN207424987U (en) * | 2017-05-24 | 2018-05-29 | 南京华设科技股份有限公司 | Intelligent queue system |
| CN108090597A (en) * | 2017-12-29 | 2018-05-29 | 珠海国芯云科技有限公司 | Medical appointment and queuing optimization method and device |
| CN108446837A (en) * | 2018-03-07 | 2018-08-24 | 中国人民大学 | A kind of load optimized method of medical services recommended work |
| CN108520349A (en) * | 2018-03-30 | 2018-09-11 | 深圳市零度智控科技有限公司 | Bank client shunt method and system, storage medium |
| CN109377633A (en) * | 2018-11-26 | 2019-02-22 | 平安科技（深圳）有限公司 | A kind of queue number generation method and terminal device |
Non-Patent Citations (1)
| Title |
|---|
| 基于排队论的内科门诊排队系统模型分析;王松建;《数理医药学杂志》;20150228;第159-160页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109934987A (en) | 2019-06-25 |
| WO2020192136A1 (en) | 2020-10-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109934987B (en) | Intelligent transfer queuing method and device | |
| Barak-Corren et al. | Progressive prediction of hospitalisation in the emergency department: uncovering hidden patterns to improve patient flow | |
| CN107944000B (en) | Flight freight rate updating method and device, electronic equipment and storage medium | |
| US11544112B1 (en) | Task processing utilizing queues | |
| CN110825440A (en) | Instruction execution method and device | |
| CN108665963A (en) | A kind of image data analysis method and relevant device | |
| Couderc et al. | Is PrEP needed for MSM in West Africa? HIV incidence in a prospective multicountry cohort | |
| Hsiao et al. | A randomized trial to assess the efficacy of point-of-care testing in decreasing length of stay in a pediatric emergency department | |
| CN109255721A (en) | Insurance recommended method, equipment, server and readable medium based on Cost Forecast | |
| KR20190082124A (en) | Method for providing forecasted waiting time information and apparatus thereof | |
| Isfahani et al. | Decreased emergency department overcrowding by discharge lounge: A computer simulation study | |
| Elli et al. | Efficacy of endoscopic triage during the Covid-19 outbreak and infective risk | |
| CN108090597A (en) | Medical appointment and queuing optimization method and device | |
| WO2020192138A1 (en) | Missed number activation method and device | |
| Lance et al. | Comparison between short text messages and phone calls to reduce no-show rates in outpatient medical appointments: a randomized trial | |
| CN110534183A (en) | Patient's inspection item point examines method and system | |
| CN107292111B (en) | Information processing method and server | |
| CN105354778A (en) | Awaiting diagnosis number calling method and apparatus and awaiting diagnosis number calling machine | |
| Trope et al. | Reaching beyond pregnant women to eliminate mother-to-child transmission of syphilis in Africa | |
| CN111292846A (en) | Cloud platform system capable of providing intelligent inquiry service | |
| WO2023240830A1 (en) | Information management method and apparatus, and device and medium | |
| CN116434934A (en) | Message queue-based patient waiting method and device, electronic equipment and medium | |
| ter Avest et al. | Hurry up, it´ s quiet in the emergency department | |
| CN114020429A (en) | Task processing method and device, equipment and storage medium | |
| WO2020192137A1 (en) | Method and device for taking a number |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |