CN110858423A

CN110858423A - Queuing scheme, queue pushing method and processing system

Info

Publication number: CN110858423A
Application number: CN201810973132.0A
Authority: CN
Inventors: 张旋辰; 费天翔
Original assignee: Alibaba Health Information Technology Ltd
Current assignee: Alibaba Health Information Technology Ltd
Priority date: 2018-08-24
Filing date: 2018-08-24
Publication date: 2020-03-03

Abstract

The application provides a queuing scheme, a queue pushing method and a processing system, wherein the method comprises the following steps: acquiring an identity of a target user; acquiring the to-be-arranged item corresponding to the identity; generating a queuing scheme of the items to be arranged for the target user according to the shortest total time for the target user to finish the items to be arranged; and pushing the queuing scheme to the target user. By utilizing the technical scheme provided by the embodiment of the application, the problems that in the existing multi-project scene, the queuing scheme is unreasonable and the queuing efficiency is low due to the fact that the user queues according to the own idea can be solved, and the technical effects of effectively improving the queuing efficiency and improving the user experience are achieved.

Description

Queuing scheme, queue pushing method and processing system

Technical Field

The application belongs to the technical field of internet, and particularly relates to a queuing scheme, a queue pushing method and a processing system.

Background

At present, for some multi-service systems (for example, physical examination systems), users generally perform sequential numbering after completing one project and then going to another project. For example, when a user goes to a hospital for physical examination, there are 8 individual examination items, and the user generally selects an item for physical examination based on his own judgment, and after the examination of the item, selects one item from the remaining 7 items, then queues the selected item in sequence, and after the user goes to himself for physical examination, proceeds to the next item.

Because the duration of each item, the possible queuing time and the like are unclear to the user, a long time is wasted when the user arranges the items each time, the time arrangement is unreasonable, and the problem that the queuing time of the whole flow of some users is too long often occurs.

In view of the above problems, no effective solution has been proposed.

Disclosure of Invention

The application aims to provide a queuing scheme, a queue pushing method and a processing system, and the technical effect of effectively improving the queuing efficiency can be achieved.

The application provides a queuing scheme, a queue pushing method and a processing system, which are realized as follows:

a queuing scheme pushing method, the method comprising:

acquiring an identity of a target user;

acquiring the to-be-arranged item corresponding to the identity;

generating a queuing scheme of the items to be arranged for the target user according to the shortest total time for the target user to finish the items to be arranged;

and pushing the queuing scheme to the target user.

A queuing information display method comprises the following steps:

providing a display interface;

receiving a queuing scheme of a target user pushed by a server, wherein the queuing scheme is a queuing scheme generated for the target user according to the shortest total time of the target user for completing a project to be arranged;

displaying the queuing scheme, wherein the queuing scheme is used for indicating the queuing order of the items to be arranged by the target user.

A method of queue pushing, the method comprising:

generating a queuing scheme of the items to be arranged for the target user according to the shortest total time of the target user for completing the items to be arranged;

adding the identity of the target user to a queuing queue of the item indicated by the queuing scheme according to the generated queuing scheme;

and pushing the added queuing queue to a corresponding project terminal.

A terminal device, comprising:

the receiver is used for receiving a queuing scheme of a target user pushed by the server;

and the display is used for displaying the queuing scheme, wherein the queuing scheme is generated for the target user according to the shortest total time of finishing the items to be arranged by the target user, and the queuing scheme is used for indicating the queuing sequence of the items to be arranged by the target user.

A processing system, comprising: server, display terminal, wherein:

the server is used for acquiring the identity of a target user and the to-be-arranged item corresponding to the identity; generating a queuing scheme of the items to be arranged for the target user according to the shortest total time for the target user to finish the items to be arranged; pushing the queuing scheme to the display terminal;

and the display terminal is used for displaying the queuing scheme.

A processing system, comprising: server, display terminal and project end equipment, wherein:

the display terminal is used for displaying the queuing scheme;

the server is further configured to add the identity of the target user to a queuing queue of the item indicated by the queuing scheme according to the generated queuing scheme, and push the added queuing queue to the corresponding item end device;

and the item end equipment is used for receiving and displaying the queuing queue.

A server comprising a processor and a memory for storing processor-executable instructions, the instructions when executed by the processor implementing the steps of the above method.

A computer readable storage medium having stored thereon computer instructions which, when executed, implement the steps of the above-described method.

According to the queuing scheme pushing method and the queuing queue pushing method, the queuing scheme of each user is generated by the system side, and then the queuing scheme is pushed to the user to inform the user of queuing according to the queuing scheme generated by the system, so that the problems that the queuing scheme is unreasonable and the queuing efficiency is low due to the fact that the user queues according to own idea in the existing multi-project scene are solved, and the technical effects of effectively improving the queuing efficiency and improving the user experience are achieved.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without any creative effort.

FIG. 1 is a schematic diagram of the architecture of a queuing system provided herein;

FIG. 2 is a schematic diagram of the generation of a queuing scheme provided herein;

FIG. 3 is a schematic diagram of another architecture of a queuing system provided herein;

figure 4 is a flow chart of a physical examination provided herein;

FIG. 5 is a schematic diagram of a user terminal interface provided by the present application;

FIG. 6 is another schematic view of a user terminal interface provided herein;

FIG. 7 is a flow chart of a queuing scheme pushing method provided by the present application;

FIG. 8 is a flow chart of a queuing queue pushing method provided by the present application;

FIG. 9 is a schematic diagram of the architecture of a server provided herein;

fig. 10 is a block diagram of a queuing scheme pushing apparatus provided in the present application.

Detailed Description

In order to make those skilled in the art better understand the technical solutions in the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

For the problems of the existing queuing system, if the queuing scheme of each user is generated by the system side, the queuing scheme is pushed to the user to inform the user to queue according to the queuing scheme generated by the system, so that the problems of unreasonable queuing scheme and low queuing efficiency caused by the fact that the user queues according to own idea in the existing multi-project scene can be solved.

Based on this, a queuing system is provided in this example, which is exemplified by applying the queuing system to a physical examination scene. As shown in fig. 1, the queuing system may include: server 101, terminal equipment 102.

The server 101 may be a single server, or a server cluster or a cloud server, and the server may generate queuing information for each user, that is, queuing information may be generated for each user according to an efficiency requirement, and the like, that is, a user is informed of which department to go for physical examination.

In one embodiment, the terminal device 102 may be a large-sized display, or a broadcasting device, or may be a number machine, a mobile phone, or the like, as long as it can transmit the user queuing information generated by the server 101, and the terminal device 102 may be any device.

For example, if the terminal device 102 is a display, the department to which each user should go can be displayed on the display in real time, or the current people in each department for visiting and queuing can be directly displayed. If the terminal device 102 is a mobile phone, the server may push the department whose physical examination the mobile phone holder needs to go to the mobile phone for the user to view, for example: the medical examination system is pushed to a mobile phone of a user in a mode of short messages, mails, application messages and the like, or the user scans codes in a numbering machine (for example, one code is installed before each department) to determine the next physical examination needing physical examination. The specific implementation manner can be selected according to actual needs, and the application does not limit the implementation manner.

Considering that the existing physical examination system generally selects which department the user goes to for examination according to the situation, and after the current department queuing examination is completed, the user goes to other departments to queue, there is no unified management mode which results in low queuing efficiency, and sometimes the user who comes very early may have finished physical examination very late, resulting in poor user experience.

For this reason, in this example, it is considered that the server 101 may generate a reasonable queuing scheme for the user in a virtual queuing manner for each user, and push the generated queuing scheme to the user to guide the user to queue. The following describes the whole implementation process, taking a user a as an example:

after the user A arrives at the physical examination center, the user A can register in the physical examination system by swiping an identity card or other identification means (for example, swiping a fingerprint, recognizing a face, swiping a physical examination card, etc.), which indicates that the physical examination center has arrived to start physical examination. After identifying the user A, the server can acquire physical examination items of the user A needing physical examination, and then arrange a physical examination process for the user A. That is, the server 101 may determine, by using preset algorithm logic, which physical examination department the user a currently goes to for physical examination, so that the physical examination duration is as short as possible, and after determining the department the user a currently needs to perform physical examination, may push the determined department arranged for the user a to the user a. For example, a broadcast mode may be adopted, department information may also be pushed to a mobile phone of the user to inform the user a of which department to go for physical examination, or the user may also query through a plurality of query instruments (for example, a code scanning queuing machine) arranged in a physical examination center, for example, the user may swipe his own physical examination card, display the department to which the user a should go now on the instrument, and in the expected physical examination duration and queuing duration, may also print the information for the user to view.

In the specific implementation, considering that the number of people who arrive at the physical examination center is variable, and the specific time in the physical examination process is not fixed, if the user arrives at the physical examination center to start the physical examination, all departments are arranged for the user, and it is inevitable that intermediate variables cannot be considered, and it is difficult to give the user a reasonable arrangement.

In one embodiment, the queuing scheme may be generated on the basis of the shortest total time for the target user to complete the item to be scheduled. For example, the physical examination item order of the target user may be determined according to the average physical examination time of each item in the physical examination items that the target user has not yet detected, the number of users that have queued for each item, and the number of users that are to be queued.

The following description will be given by taking as an example that the user is reminded of past physical examinations in the order of pushing two physical examination items to the target user each time:

as shown in fig. 2, the user 3 is a target user, there are 8 users in physical examination in total, and the physical examination process of the user 3 includes

departments

1, 2, 3, 4 and 5. Wherein:

1) each physical examination of department 1 takes 4 time units, and currently department 1 has two people in line (1 and 2) and 5 people out of line (4, 5, 6, 7 and 8).

Based on this, it can be calculated that if the user 3 is ranked in the department 1, the time of the examination start is 8(4 × 2), the time of the examination end is 12(4 × 2+4), and the profit (i.e., the time required for the non-examined population) is 20(4 × 5).

2) Each physical examination item in department 2 takes 6 time units, and currently department 2 has 7 people in line (8, 4, 7, 5, 6, 1 and 2) and 0 people out of line.

Based on this, it can be calculated that if the user 3 is ranked in the department 2, the time when the examination starts is 42(6 × 7), the time when the examination ends is 48(6 × 7+6), and the profit (i.e., the time required for the non-examined population) is 0(6 × 0).

3) The physical examination of department 3 takes 9 time units for each examination, and currently department 3 has 4 people queued (6, 7, 8, and 1) and 3 people not queued (2, 5, and 4).

Based on this, it can be calculated that if the user 3 is ranked in the department 3, the time of the examination start is 36(4 × 9), the time of the examination end is 45(4 × 9+9), and the profit (i.e., the time required for the non-examined population) is 27(3 × 9).

4) Each physical examination of department 4 takes 4 time units, and currently department 4 has 3 people in line (5, 4, and 7) and 4 people out of line (2, 1, 8, and 6).

Based on this, it can be calculated that if the user 3 is ranked in the department 4, the time of the examination start is 12(3 × 4), the time of the examination end is 16(3 × 4+4), and the profit (i.e., the time required for the non-examined population) is 16(4 × 4).

5) Each physical examination of department 5 takes 3 time units, and currently department 5 has 2 people queued (1 and 2) and 5 people not queued (4, 5, 6, 7, and 8).

Based on this, it can be calculated that if the user 3 is ranked in the department 5, the time of the examination start is 6(2 × 3), the time of the examination end is 9(2 × 3+3), and the profit (i.e., the time required for the non-examined population) is 15(5 × 3).

After the data of the five departments are determined, two departments can be compared, and the department where the intersection does not exist between the examination starting time and the examination ending time is found out. For example, department 1 and department 5 intersect each other, and department 2 and department 3 intersect each other, so that the user cannot be arranged in the order of examination of department 1 to department 5, nor in the order of examination of department 2 to department 3. For departments with no conflict in examination, the department with the shortest sum of the two departments may be selected as the physical examination order arranged for the user 3, or the two departments with the highest average profit may be selected as the physical examination order arranged for the user 3.

The specific average profit can be calculated according to the following formula: (benefit of target department 1 + benefit of target department 2)/(end time of target department 2-start time of target department 1), wherein the end time of target department 1 is earlier than the start time of target department 2.

For example: the average earnings of department 1 and department 2 were (20+0)/(48-8) ═ 0.5;

the average earnings of department 1 and department 3 were (20+27)/(45-8) ═ 1.27;

the average earnings of department 1 and department 4 were (20+16)/(16-8) ═ 4.5;

department 1 and department 5 are coincident;

……

the average benefit of

departments

4 and 5 was (20+15)/(16-6) ═ 3.5.

After calculation, it can be determined that the user 3 is scheduled to perform a physical examination in the department 1 and then to the department 4.

That is, a concept of virtual queuing is equivalently proposed, when each user comes for physical examination, a virtual node is generated in a queue needing physical examination, and each queue needing physical examination has a virtual mirror image. The system judges whether the node is a real node, a virtual node and the real node exist in each queue, and the physical examination time of the real node is used for calculating the average examination time of departments. By using the virtual autonomous queuing strategy, the user can virtually queue all departments immediately after entering physical examination, and the system dynamically allocates queue insertion, so that the physical examination efficiency is effectively improved.

It should be noted that, in the above example, the two physical examination items are arranged for the user at a time, and in actual implementation, only one physical examination item may be arranged for the user at a time, and the arranged physical examination item may be the item with the highest average benefit, or the item with the shortest queuing time, and may be specifically selected according to actual needs. It is also possible to arrange three physical examination items or more physical examination items for the user at a time, and similarly, in the case of three items, it is also possible to determine which three physical examination items are arranged for the user in such a manner that the average profit is the highest.

The above listed determination of arranging the physical examination items for the users with the highest average profit is an exemplary description, and when the determination is actually implemented, other determination methods may also be adopted, for example, a reasonable examination and queuing sequence of each user may be determined by fully arranging all users in all departments according to the sequence of entering the physical examination center, and then the queuing information of each user is pushed to the user, and the examination and queuing sequence may be adjusted in real time based on the situations of all physical examination persons at each time point. The queuing scheme is feasible as long as the queuing scheme can improve the overall physical examination efficiency and simultaneously avoid the problem that the physical examination total time of some users is too long.

The above is mainly an explanation of pushing the physical examination queuing information to the user, and in actual implementation, the physical examination system may be a complete system, which not only can implement pushing of the queuing information of the user, but also as shown in fig. 3, includes: the doctor-side terminal 103, on the doctor-side terminal, may be pushed a physical examination queue of the physical examination doctor, and the users assigned to the doctor will appear in the physical examination user list of the doctor in order, and after the doctor finishes one user each time, the user may be deleted from the physical examination queue.

Considering that in the actual physical examination process, some users have already arrived at their physical examination time for some reasons, but have not arrived at the corresponding physical examination department for physical examination, it is certainly unreasonable if the medical doctor waits indefinitely. An allowable waiting time can be set, if the currently scheduled physical examination user exceeds the allowable waiting time and does not go on physical examination, the currently scheduled physical examination user can be automatically scheduled to a position relatively behind the physical examination queue of the department, other physical examination users in the physical examination queue sequentially move forward by one position, and the change information is pushed to various physical examination personnel in real time.

In order to enable the whole queuing physical examination process to be more reasonable, the server can adjust and re-optimize the queuing information of the physical examination users in real time according to the current actual physical examination situation, and timely push the adjusted more reasonable queuing scheme to the user side equipment and the hospital side terminal. And the average check time of each department used in the determination of the queuing scheme of the user can be adjusted according to the actual situation, so that the finally formed queuing scheme is more reasonable.

In the actual implementation process, as shown in fig. 4, the whole process may be implemented according to the following steps:

s1: the user enters a physical examination process in a code scanning mode of a client and the like, and the system can identify all physical examination items and corresponding departments of the user according to the identity of the user;

s2: the system arranges a physical examination scheme for the user according to the current situation of each department, namely, determines which department the user goes to for examination first and then which department for examination;

s3: the client receives a push message sent by the system, and informs the user of which department the user should go through by the push message, and when the system generates a physical examination scheme, certain time redundancy needs to be added so that the user can arrive at the corresponding department;

s4: after the user arrives at the department and completes the examination, the client may again calculate the next physical department the user goes to.

For the user, after reaching a designated department, the user needs to queue up, and specifically, the client and the physical examination doctor can perform physical examination according to the following procedures:

s1: after the user reaches a designated department, automatically queuing in the department;

s2: for the queuing users, the doctors check one by one according to the queuing sequence, and delete the users in the queuing queue after the checking is finished;

s3: in the physical examination process, for the users who are already discharged but do not enter the physical examination department for physical examination beyond the preset time, a physical examination doctor marks that the users do not arrive on time, performs physical examination on the next user, and places the users who do not arrive on time to the end of the queue;

s4: for a system that generates a queuing scheme, the average physical examination duration for the department can be calculated based on the number of people who have already been physically examined and the total time required to physically examine those people.

As shown in fig. 5, as an interface schematic diagram of the user terminal, the server may push the generated medical examination plan to a medical examination notification application pre-installed in the terminal for the user to view, for example, a time schedule of generating two items each time, which mainly considers that there are many uncertain factors in scheduling too many items, and scheduling two items at a time is more accurate and more efficient. As shown in fig. 6, another schematic view of the user terminal interface, a completion button may be displayed on the interface, and if the user arrives at the department and completes the physical examination by time, for example, the user reaches the department at a scheduled time and the examination is completed, the completion button may be clicked to indicate that the examination of the department has been completed. Further, a button may also be displayed for user activation to see which physical examination items are not scheduled.

For the system side, it is necessary to acquire information of each physical examination user in real time, information fed back by each department doctor, and the like, so that the generated queuing scheme is more reasonable.

In the above example, the queuing scheme of the physical examination personnel is generated by the system in a unified manner, the system informs the user which department should go to for the physical examination, and after the physical examination of the department is completed, the user goes to which department to queue for the physical examination instead of randomly selecting one department by the user to queue, and then selecting one department to queue. By means of the mode that the system generates the physical examination queuing scheme in a unified mode in the above example, the problem that some physical examination users have too long physical examination time can be effectively avoided, and user experience is improved.

Furthermore, when the queuing scheme of each user is actually generated, the time of the current user arriving at the physical examination center can be considered, and the users who arrive earlier can be arranged at the position relatively ahead than the users who arrive later as far as possible, so that the users who arrive earlier are more advantageous.

The above-mentioned contents are explained by taking a physical examination scene as an example of a target scene, and the pushing method of the queuing scheme, the pushing method of the queuing queue and the queuing system provided by this example can be applied not only to a physical examination system, but also to other multi-item scenes, for example: the method is applied to playgrounds and the like, and is particularly applied to specific scenes, which is not limited in the present application.

Taking application in a playground scene as an example, the generated queuing scheme can be generated in the manner described above, and the main difference is that in the physical examination system, the physical examination items of the user can be obtained by swiping a physical examination card or an identity card of the user. However, in a casino, the user's play items are not fixed, nor uniform. Therefore, a project selection interface can be provided in the amusement park APP, a user selects an amusement project which the user wants to do on the same day, then the project selected by the user generates a project to be arranged corresponding to the user, then a queuing sequence of the selected projects is generated for the user to form a queuing scheme, and the queuing scheme is pushed to the user, so that the queuing time of the user can be reduced, and the time for the user to finish all the selected projects is the shortest.

The following description will be given by taking as an example that the sequence of pushing two entertainment items to a target user each time reminds the user of queuing play in the past:

user 3 is the target user, and a total of 8 users are in the casino, with the selected play items of user 3 including item 1, item 2, item 3, item 4, and item 5. Wherein:

1) the experience of project 1 all takes 4 time units, with project 1 currently having two people queued (1 and 2), and 5 people selected not to be queued (4, 5, 6, 7, and 8).

Based on this, it can be calculated that if the user 3 ranks in item 1, the time of the experience beginning is 8(4 × 2), the time of the experience ending is 12(4 × 2+4), and the benefit (i.e., the time required for selecting the non-experience group) is 20(4 × 5).

2) The experience of project 2 all takes 6 time units, with project 2 already having 7 people queued (8, 4, 7, 5, 6, 1, and 2) and 0 people not queued.

Based on this, it can be calculated that if the user 3 ranks in item 2, the time of the experience start is 42(6 × 7), the time of the experience end is 48(6 × 7+6), and the profit (i.e., the time required for the selected but unexperienced population) is 0(6 × 0).

3) The experience of project 3 all takes 9 time units, with project 3 having currently 4 people queued (6, 7, 8, and 1) and 3 people not queued (2, 5, and 4).

Based on this, it can be calculated that if the user 3 ranks at item 3, the time of the start of the experience is 36(4 × 9), the time of the end of the experience is 45(4 × 9+9), and the revenue (i.e., the time required for the selected but unexperienced population) is 27(3 × 9).

4) The experience of project 4 all takes 4 time units, with project 4 having currently 3 people queued (5, 4, and 7) and 4 people not queued (2, 1, 8, and 6).

Based on this, it can be calculated that if the user 3 ranks at item 4, the time of the experience start is 12(3 × 4), the time of the experience end is 16(3 × 4+4), and the profit (i.e., the time required for the selected but unexperienced population) is 16(4 × 4).

5) The experience of item 5 all takes 3 time units, with item 5 now having 2 people queued (1 and 2) and 5 people not queued (4, 5, 6, 7, and 8).

Based on this, it can be calculated that if the user 3 ranks at item 5, the time of the experience start is 6(2 × 3), the time of the experience end is 9(2 × 3+3), and the benefit (i.e., the time required for the selected but unexperienced population) is 15(5 × 3).

After the data of the five items are determined, two items can be compared, and the items with no intersection between the experience starting time and the experience ending time are found out. For example, item 1 and item 5 intersect, and item 2 and item 3 intersect, so the user cannot be arranged with the checking order of item 1 to item 5, nor the queuing order of item 2 to item 3. For items with no conflict in time, the item with the shortest time taken by the two items together may be selected as the experience order arranged for the user 3, or the two items with the highest average profit may be selected as the order arranged for the user 3.

Specifically, the average profit may be calculated according to the following formula: (benefit of target project 1 + benefit of target project 2)/(end time of target project 2-start time of target project 1), wherein the end time of target project 1 is earlier than the start time of target project 2.

For example: the average benefit of project 1 and project 2 was (20+0)/(48-8) ═ 0.5;

the average benefit of project 1 and project 3 was (20+27)/(45-8) ═ 1.27;

the average benefit of project 1 and project 4 was (20+16)/(16-8) ═ 4.5;

item 1 and item 5 overlap;

……

the average benefit of

items

4 and 5 was (20+15)/(16-6) ═ 3.5.

After the calculation, it can be determined that the user 3 is scheduled to experience first in item 1 and then in item 4.

Namely, a concept of virtual queuing is proposed, each user plays at a playground, a virtual node is generated in a queue of items selected to be experienced by the user, and each queue needing to be experienced has a virtual mirror image. The system judges whether the node is a real node or not, a virtual node and a real node exist in each queue, and the physical examination time of the real node is used for calculating the average experience time of the project. By using the virtual autonomous queuing strategy, after a user enters a self-creation, all items are virtually queued immediately, and the system dynamically allocates queue insertion, so that the physical examination efficiency is effectively improved.

It should be noted that, in the above example, the description is given by taking an example of arranging two experience items for a user at a time, and in actual implementation, only one experience item may be arranged for the user at a time, and then the arranged experience item may be an item with the highest average benefit, or an item with the shortest queuing time, and may be specifically selected according to actual needs. It is also possible to schedule three or more experience items for the user at a time, and likewise, if there are three items, it is also possible to determine which three experience items are scheduled for the user in a manner that the average profit is the highest.

The above listed project arrangement with the highest average profit is an exemplary description, and when the actual implementation is performed, other determining manners may also be adopted, for example, a manner of fully arranging the projects selected by all users to be experienced according to the sequence of entering the casino may be adopted, a reasonable experience and queuing sequence of each user may be determined, then the queuing information of each user is pushed to the user, and the queuing scheme may be adjusted in real time based on the conditions of all users at each time point. The queuing scheme is feasible as long as the queuing scheme can improve the overall experience efficiency and avoid the problem that some users experience too long time.

Fig. 7 is a flowchart of a queuing scheme pushing method according to the present application. Although the present application provides method operational steps or apparatus configurations as illustrated in the following examples or figures, more or fewer operational steps or modular units may be included in the methods or apparatus based on conventional or non-inventive efforts. In the case of steps or structures which do not logically have the necessary cause and effect relationship, the execution sequence of the steps or the module structure of the apparatus is not limited to the execution sequence or the module structure described in the embodiments and shown in the drawings of the present application. When the described method or module structure is applied in an actual device or end product, the method or module structure according to the embodiments or shown in the drawings can be executed sequentially or executed in parallel (for example, in a parallel processor or multi-thread processing environment, or even in a distributed processing environment).

Specifically, as shown in fig. 7, a queuing scheme pushing method provided in an embodiment of the present application is described from interaction between a user terminal and a server, and may include:

step 701: acquiring an identity of a target user;

step 702: acquiring the to-be-arranged item corresponding to the identity;

step 703: generating a queuing scheme for the target user, for example, the queuing scheme may be generated according to the principle that the target user is shortest when completing the project to be arranged, and in the case that there are multiple users in the system, it is ensured that the user of each target user is shortest to perform balancing, thereby generating a more optimized queuing scheme;

step 704: and pushing the queuing scheme to the target user.

Specifically, the step 703 of generating a queuing scheme for the items to be arranged for the target user may include:

s1: acquiring the average time of each item in the items to be scheduled;

s2: acquiring the number of queued users and the number of non-queued users of each item in the items to be arranged;

s3: and generating a queuing scheme for the target user according to the obtained average time, the number of queued users and the number of non-queued users.

In one embodiment, generating a queuing scheme for the target user according to the obtained average check time, the number of queued users, and the number of non-queued users may include:

according to the obtained average time and the number of queued users, determining the starting time and the ending time of the target user under the condition that the target user is arranged at the last position of the current queue of each item in the items to be scheduled;

according to the obtained average time consumption and the number of the users which are not queued, determining the income of the target user under the condition that the target user is queued at the last position of the current queue of each item in the items to be scheduled;

and generating a queuing scheme for the target user according to the determined starting time, ending time and benefit.

In one embodiment, generating a queuing scheme for the target user based on the determined start time, end time, and benefit may include: generating a plurality of queuing schemes in a mode of arranging and combining all the items in the items to be arranged; and taking the feasible scheme with the maximum average profit in the plurality of queuing schemes as the queuing scheme generated for the target user.

In one embodiment, the average time of each item in the items to be scheduled is calculated and obtained in real time, and the number of queued users and the number of non-queued users of each item in the items to be scheduled are obtained in real time.

In one embodiment, the queuing scheme may be pushed to the target user by, but is not limited to, at least one of:

1) displaying the queuing scheme on a display;

2) sending the queuing scheme to terminal equipment held by a target user;

3) and playing the queuing scheme in a voice broadcasting mode.

In a specific implementation, after all items in the queuing scheme arranged for the target user are completed, the queuing scheme for the remaining items is arranged for the user, that is, an end message that the items in the scheme generated for the target user are completed may be obtained; and responding to the ending message, and acquiring the to-be-arranged item corresponding to the identity.

The application also provides a queuing information display method, which is applied to the user terminal side and can comprise the following steps:

step 1: providing a display interface;

step 2: receiving a queuing scheme pushed by a server, wherein the queuing scheme is a queuing scheme generated for a target user according to the shortest total time of the target user for completing a project to be arranged;

and step 3: displaying the queuing scheme, wherein the queuing scheme is used for indicating the queuing sequence of the items to be arranged by the target user.

Namely, the queuing scheme pushed to the user can be displayed at the user terminal, so that the user can queue according to the pushed queuing scheme, and the queuing efficiency can be effectively improved.

The queuing scheme may include: the item name of the next item, the queuing location of the next item. For example, if the user is a queuing scheme for physical examination, after the user completes the current physical examination, the user can know what the next physical examination item is arranged and where the item is, and can queue according to the pushed queuing scheme, so that the physical examination can be completed efficiently. If the queuing scheme is the queuing scheme of the amusement park, after the user experiences the current project, the user can know what the next experience project is arranged and where the next project is, and the user can queue according to the pushing scheme, so that the queuing time can be shortened, and the project selected by the user can be reasonably experienced.

As shown in fig. 8, a queue pushing method provided in an embodiment of the present application is described from an interaction between a project terminal and a server, and may include:

step 801: generating a queuing scheme of the items to be arranged for the target user according to the shortest total time of the target user for completing the items to be arranged;

step 802: adding the identity of the target user to a queuing queue of the item indicated by the queuing scheme according to the generated queuing scheme;

step 803: and pushing the added queuing queue to a corresponding project terminal.

In an embodiment, after the added queuing queue is pushed to the corresponding project terminal, the method may further include: receiving completion information for indicating that the target user has reached the location of the project and is completed; and in response to the completion information, deleting the identification of the target user from the queuing queue.

In an embodiment, after the added queuing queue is pushed to the corresponding item location, failure information indicating that the target user does not arrive at the corresponding item location in the order of the queuing queue and is not completed may also be received; and responding to the failure information, and adjusting the position of the identification of the target user in the queuing queue.

There is also provided, in accordance with an embodiment of the present invention, an embodiment of a queuing scheme pushing method, it being noted that the steps illustrated in the flowchart of the figure may be performed in a computer system such as a set of computer-executable instructions, and that, although a logical order is illustrated in the flowchart, in some cases the steps illustrated or described may be performed in an order different than here.

The method provided by the embodiment of the application can be executed in a mobile terminal, a computer terminal or a similar operation device. Taking the example of running on a server, fig. 9 is a block diagram of a hardware structure of the server of a queuing scheme pushing method according to the embodiment of the present invention. As shown in fig. 9, the server 10 may include one or more (only one shown) processors 102 (the processors 102 may include, but are not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA, etc.), a memory 104 for storing data, and a transmission module 106 for communication functions. It will be understood by those skilled in the art that the structure shown in fig. 9 is only an illustration and is not intended to limit the structure of the electronic device. For example, the server 10 may also include more or fewer components than shown in FIG. 9, or have a different configuration than shown in FIG. 9.

The memory 104 may be used to store software programs and modules of application software, such as program instructions/modules corresponding to the queuing scheme pushing method in the embodiment of the present invention, and the processor 102 executes various functional applications and data processing by running the software programs and modules stored in the memory 104, that is, implements the queuing scheme pushing method of the application program. The memory 104 may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include memory located remotely from the processor 102, which may be connected to the computer terminal 10 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The transmission module 106 is used to receive or transmit data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the computer terminal 10. In one example, the transmission module 106 includes a Network adapter (NIC) that can be connected to other Network devices through a base station to communicate with the internet. In one example, the transmission module 106 may be a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.

Software layer, queuing scheme pushing apparatus as shown in fig. 10, may include: a first obtaining module 1001, a second obtaining module 1002, a generating module 1003 and a pushing module 1004, wherein:

a first obtaining module 1001, configured to obtain an identity of a target user;

a second obtaining module 1002, configured to obtain an item to be arranged corresponding to the identity;

a generating module 1003, configured to generate a queuing scheme of the items to be scheduled for the target user;

a pushing module 1004, configured to push the queuing scheme to the target user.

In one embodiment, the generating module 1003 may specifically obtain an average time used by each item in the to-be-scheduled items; acquiring the number of queued users and the number of non-queued users of each item in the items to be arranged; and generating a queuing scheme for the target user according to the obtained average time, the number of queued users and the number of non-queued users.

In an embodiment, the generating module 1003 generates a queuing scheme for the target user according to the obtained average check time, the number of queued users, and the number of non-queued users, and may include: according to the obtained average time and the number of queued users, determining the starting time and the ending time of the target user under the condition that the target user is arranged at the last position of the current queue of each item in the items to be scheduled; according to the obtained average time consumption and the number of the users which are not queued, determining the income of the target user under the condition that the target user is queued at the last position of the current queue of each item in the items to be scheduled; and generating a queuing scheme for the target user according to the determined starting time, ending time and benefit.

In one embodiment, the generating module 1003 generates a queuing scheme for the target user according to the determined start time, end time and benefit, which may include: generating a plurality of queuing schemes in a mode of arranging and combining all the items in the items to be arranged; and taking the feasible scheme with the maximum average profit in the plurality of queuing schemes as the queuing scheme generated for the target user.

In one embodiment, obtaining the average checking time of each item in the to-be-scheduled items may include: calculating and acquiring the average time of each item in the items to be scheduled in real time; and acquiring the number of queued users and the number of non-queued users of each item in the items to be arranged in real time.

1) displaying the queuing scheme on a display;

2) sending the queuing scheme to terminal equipment held by a target user;

3) and playing the queuing scheme in a voice broadcasting mode.

In one embodiment, the first obtaining module 1001 may specifically obtain an end message that a project in a solution generated for the target user is completed; and responding to the ending message, and acquiring the to-be-arranged item corresponding to the identity.

On the software level, the queue pushing device may include: the device comprises a generation module, an addition module and a pushing module, wherein:

the generating module is used for generating a queuing scheme of the items to be arranged for the target user;

the adding module is used for adding the identity of the target user to a queuing queue of the item indicated by the queuing scheme according to the generated queuing scheme;

and the pushing module is used for pushing the added queuing queue to the corresponding project terminal.

In an embodiment, the system may further include a receiving module, configured to receive, after pushing the added queuing queue to the corresponding project terminal, completion information indicating that the target user has reached the project location and completed; and the deleting module is used for responding to the completion information and deleting the identity of the target user from the queuing queue.

In one embodiment, after the added queuing queue is pushed to the corresponding item location, failure information used for indicating that the target user does not arrive at the corresponding item location according to the sequence of the queuing queue and is not completed is received; and responding to the failure information, and adjusting the position of the identification of the target user in the queuing queue.

Although the present application provides method steps as described in an embodiment or flowchart, additional or fewer steps may be included based on conventional or non-inventive efforts. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an actual apparatus or client product executes, it may execute sequentially or in parallel (e.g., in the context of parallel processors or multi-threaded processing) according to the embodiments or methods shown in the figures.

The apparatuses or modules illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. For convenience of description, the above devices are described as being divided into various modules by functions, and are described separately. The functionality of the modules may be implemented in the same one or more software and/or hardware implementations of the present application. Of course, a module that implements a certain function may be implemented by a plurality of sub-modules or sub-units in combination.

The methods, apparatus or modules described herein may be implemented in computer readable program code to a controller implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer readable medium storing computer readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, Application Specific Integrated Circuits (ASICs), programmable logic controllers and embedded microcontrollers, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic for the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may therefore be considered as a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.

Some of the modules in the apparatus described herein may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, classes, etc. that perform particular tasks or implement particular abstract data types. The application may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

From the above description of the embodiments, it is clear to those skilled in the art that the present application can be implemented by software plus necessary hardware. Based on such understanding, the technical solutions of the present application may be embodied in the form of software products or in the implementation process of data migration, which essentially or partially contributes to the prior art. The computer software product may be stored in a storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, mobile terminal, server, or network device, etc.) to perform the methods described in the various embodiments or portions of the embodiments of the present application.

The embodiments in the present specification are described in a progressive manner, and the same or similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. All or portions of the present application are operational with numerous general purpose or special purpose computing system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet-type devices, mobile communication terminals, multiprocessor systems, microprocessor-based systems, programmable electronic devices, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.

While the present application has been described with examples, those of ordinary skill in the art will appreciate that there are numerous variations and permutations of the present application without departing from the spirit of the application, and it is intended that the appended claims encompass such variations and permutations without departing from the spirit of the application.

Claims

1. A queuing scheme pushing method is characterized by comprising the following steps:

acquiring an identity of a target user;

acquiring the to-be-arranged item corresponding to the identity;

and pushing the queuing scheme to the target user.

2. The method of claim 1, wherein generating a queuing scheme for the target user for the items to be scheduled comprises:

acquiring physical examination items to be scheduled;

and taking the minimum total time for completing the physical examination items to be arranged as a solving target, and generating the sequence of the physical examination items for the target user.

3. The method of claim 1, wherein generating a queuing scheme for the target user for the items to be scheduled comprises:

acquiring an entertainment item to be arranged;

and taking the minimum total time for completing the entertainment items to be arranged as a solving target, and generating the sequence of the entertainment items for the target user.

4. The method of claim 1, wherein generating a queuing scheme for the target user for the items to be scheduled comprises:

acquiring the average time of each item in the items to be scheduled;

acquiring the number of queued users and the number of non-queued users of each item in the items to be arranged;

and generating a queuing scheme for the target user according to the obtained average time, the number of queued users and the number of non-queued users.

5. The method of claim 4, wherein generating a queuing scheme for the target user based on the obtained average check-up time, the number of queued users, and the number of non-queued users comprises:

6. The method of claim 5, wherein generating a queuing scheme for the target user based on the determined start time, end time, and revenue comprises:

generating a plurality of queuing schemes in a mode of arranging and combining all the items in the items to be arranged;

and taking the feasible scheme with the maximum average profit in the plurality of queuing schemes as the queuing scheme generated for the target user.

7. The method of claim 4, wherein obtaining an average check time for each of the items to be scheduled comprises:

calculating and acquiring the average time of each item in the items to be scheduled in real time;

and acquiring the number of queued users and the number of non-queued users of each item in the items to be arranged in real time.

8. The method of claim 1, wherein the queuing scheme is pushed to the target user by at least one of:

displaying the queuing scheme on a display;

sending the queuing scheme to terminal equipment held by a target user;

and playing the queuing scheme in a voice broadcasting mode.

9. The method of claim 1, wherein obtaining the to-be-scheduled item corresponding to the identity comprises:

acquiring an end message of the project in the scheme generated for the target user;

and responding to the ending message, and acquiring the to-be-arranged item corresponding to the identity.

10. A method for displaying queuing information, comprising:

providing a display interface;

receiving a queuing scheme pushed by a server, wherein the queuing scheme is a queuing scheme generated for a target user according to the shortest total time of the target user for completing a project to be arranged;

displaying the queuing scheme, wherein the queuing scheme is used for indicating the queuing sequence of the items to be arranged by the target user.

11. The method of claim 10, wherein the queuing scheme comprises: the item name of the next item, the queuing location of the next item.

12. A method of queue pushing, the method comprising:

and pushing the added queuing queue to a corresponding project terminal.

13. The method of claim 12, wherein after pushing the added queue to the corresponding project terminal, the method further comprises:

receiving completion information for indicating that the target user has reached the location of the project and is completed;

and in response to the completion information, deleting the identification of the target user from the queuing queue.

14. The method of claim 12, wherein after pushing the added queue to the corresponding place of the item, the method further comprises:

receiving incomplete failure information which is used for indicating that the target user does not arrive at the corresponding project location according to the sequence of the queuing queue;

and responding to the failure information, and adjusting the position of the identification of the target user in the queuing queue.

15. A processing system, comprising: server, display terminal, wherein:

and the display terminal is used for displaying the queuing scheme.

16. A terminal device, comprising:

the receiver is used for receiving the queuing scheme pushed by the server;

17. The terminal device of claim 16, wherein the queuing scheme comprises: the item name of the next item, the queuing location of the next item.

18. The terminal device according to claim 16, wherein the terminal device is a smartphone.

19. A processing system, comprising: server, display terminal and project end equipment, wherein:

the display terminal is used for displaying the queuing scheme;

20. A server comprising a processor and a memory for storing processor-executable instructions which, when executed by the processor, implement the steps of the method of any one of claims 1 to 9.

21. A computer readable storage medium having stored thereon computer instructions which, when executed, implement the steps of the method of any one of claims 1 to 9.