CN112700582A - Queuing and calling method, electronic equipment and storage medium - Google Patents
Queuing and calling method, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN112700582A CN112700582A CN202011536798.3A CN202011536798A CN112700582A CN 112700582 A CN112700582 A CN 112700582A CN 202011536798 A CN202011536798 A CN 202011536798A CN 112700582 A CN112700582 A CN 112700582A
- Authority
- CN
- China
- Prior art keywords
- transaction
- queuing
- time
- requests
- transaction requests
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 70
- 238000012163 sequencing technique Methods 0.000 claims abstract description 6
- 230000000694 effects Effects 0.000 claims description 30
- 238000004590 computer program Methods 0.000 claims description 10
- 238000012795 verification Methods 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 3
- 230000002035 prolonged effect Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005192 partition Methods 0.000 description 1
Images
Landscapes
- Telephonic Communication Services (AREA)
Abstract
The invention provides a queuing and calling method, electronic equipment and a storage medium, wherein the method comprises the following steps: acquiring transaction requests of a plurality of users, wherein the transaction requests comprise starting time and transaction items; predicting the handling time length according to the handling items, and determining the ending time according to the starting time and the handling time length; determining the handling time periods of the handling requests according to the starting time and the ending time, and distributing the handling requests to the handling points according to the handling time periods based on a dynamic programming algorithm; and sequencing all the office requests of each office point in the order of the office duration from short to long to generate a number calling sequence. The technical scheme of the invention can reduce the average queuing time of the user and improve the average service handling experience of the user.
Description
Technical Field
The invention relates to the technical field of queuing and calling, in particular to a queuing and calling method, electronic equipment and a storage medium.
Background
In daily life, when a large number of users wait for business handling or medical treatment in the same time period, the users need to queue and call numbers. At present, two methods are commonly adopted for queuing and calling, wherein one method is that a user takes numbers on a self-service terminal, and a system calls the numbers in sequence according to the order of taking the numbers; the other method is that a user logs in a system to take numbers through a mobile terminal such as a mobile phone, and the system calls the numbers in sequence according to the number taking sequence. However, the two methods call numbers according to the number taking sequence, and the refinement degree of queuing management is low, which affects the average service handling experience of users.
Disclosure of Invention
The invention solves the problem of improving the average service handling experience when the user queues to handle the service.
In order to solve the above problems, the present invention provides a queuing and calling method, an electronic device, and a storage medium.
In a first aspect, the present invention provides a queuing and calling method, including:
acquiring transaction requests of a plurality of users, wherein the transaction requests comprise starting time and transaction items;
predicting the handling time length according to the handling items, and determining the ending time according to the starting time and the handling time length;
determining the handling time periods of the handling requests according to the starting time and the ending time, and distributing the handling requests to the handling points according to the handling time periods based on a dynamic programming algorithm;
and sequencing all the office requests of each office point in the order of the office duration from short to long to generate a number calling sequence.
Optionally, the allocating the transaction requests for the respective transaction points according to the start time and the end time based on the dynamic programming algorithm includes:
executing a dynamic planning algorithm for any time period, wherein the dynamic planning algorithm comprises the steps of determining all the transaction requests which are currently left in the time period, and the all the transaction requests which are currently left form an activity set;
determining transaction time periods of the transaction requests according to the starting time and the ending time, and determining a maximum compatible subset in the active set according to the time periods, wherein the maximum compatible subset comprises the transaction requests which are compatible with each other in pairs with the largest number, and the transaction time periods of any two transaction requests are not overlapped with each other to indicate that the two transaction requests are compatible;
assigning all of the transaction requests in the maximum compatible subset to one of the transaction points;
the dynamic programming algorithm is recursively executed until the transaction requests are allocated or the transaction requests have been allocated for all of the transaction requests.
Optionally, the determining a maximum compatible subset in the active set according to the time period comprises:
establishing a recursion formula according to the activity set and the time period;
and solving by adopting a bottom-up method according to the recursive formula to determine the maximum compatible subset.
Optionally, the establishing a recursive formula according to the active set and the time period comprises:
determining the recursive formula using a first formula, the first formula comprising:
where Sij represents the active set, c [ i ] [ j ] represents the number of the transaction requests included in the maximum compatible subset of the active set Sij, i represents the ith transaction request, k represents the kth transaction request, j represents the jth transaction request, c [ i ] [ k ] represents the number of the transaction requests included in the maximum compatible subset of the active set Sik, and c [ k ] [ j ] represents the number of the transaction requests included in the maximum compatible subset of the active set Skj.
Optionally, the determining a maximum compatible subset in the active set according to the time period comprises:
and sequentially selecting the transaction requests with the earliest end time from top to bottom in the activity set based on a greedy algorithm until the end time of the transaction requests exceeds the time period or all the transaction requests are traversed, and obtaining the maximum compatible subset.
Optionally, the sorting all the transaction requests of the transaction points in the order of the transaction duration from short to long comprises:
and for any one of the transaction points, adopting a greedy algorithm, sequentially selecting the transaction requests with the shortest transaction duration from all the transaction requests of the transaction points, and generating the number calling sequence.
In a second aspect, the present invention provides a queuing and calling method based on an applet, including:
acquiring transaction requests input by a plurality of users through a small program, executing the queuing and calling method according to the transaction requests, determining the calling sequence of each transaction point, respectively generating queuing numbers of the users according to the calling sequence, and feeding the queuing numbers back to the corresponding small program;
and when the queuing number is detected to be extracted by the service handling terminal, generating the number calling information of the queuing number, and sending the number calling information to the corresponding applet.
Optionally, the transaction request includes transaction items and login information, and after acquiring transaction requests input by a plurality of users through a applet, the method further includes:
determining whether the identity of the user needs to be verified according to the transaction items;
when the identity of the user needs to be verified, the identity of the user is verified according to the login information, and when the identity verification is successful, the queuing and calling method is executed according to the transaction items; when the identity authentication fails, returning authentication failure information;
when the identity of the user does not need to be verified, the queuing method is executed according to the transaction request.
In a third aspect, the present invention provides a queuing and calling device, including:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring transaction requests of a plurality of users, and the transaction requests comprise starting time and transaction items;
the processing module is used for predicting the transaction duration according to the transaction items and determining the ending time according to the starting time and the transaction duration;
the planning module is used for determining the handling time periods of the handling requests according to the starting time and the ending time, and distributing the handling requests to the handling points according to the handling time periods based on a dynamic planning algorithm;
and the number calling module is used for sequencing all the transaction requests of each transaction point in the sequence from short to long in transaction duration to generate a number calling sequence.
In a fourth aspect, the present invention provides an electronic device comprising a memory and a processor;
the memory for storing a computer program;
the processor is configured to implement the queuing and calling method as described above or the applet-based queuing and calling method as described above when the computer program is executed.
In a fifth aspect, the present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the queuing method as described above or the applet-based queuing method as described above.
The queuing and calling method, the electronic equipment and the storage medium have the beneficial effects that: the method comprises the steps of obtaining transaction requests of a plurality of users, predicting transaction duration according to input start time of a transaction to be handled and items to be handled, determining transaction time periods of the transaction requests, distributing the transaction requests for all transaction points by adopting a dynamic planning method according to the transaction time periods of the transaction requests, optimizing the distribution of the transaction requests, enabling all transaction points to process more transaction requests in a calibration time period, improving the service transaction efficiency of all transaction points and further improving the service transaction experience of the users. For each transaction point, the number calling sequence is generated according to the sequence of the transaction duration from short to long, the transaction requests with the short transaction duration can be preferentially processed in a calibration time period, the average queuing time of all users can be reduced, and the average service transaction experience of all users is improved.
Drawings
FIG. 1 is a schematic diagram of a queuing and number-taking system in the prior art;
fig. 2 is a schematic flow chart of a queuing and calling method according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating a queuing and calling method based on an applet according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a queuing and calling device according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a queuing and calling device based on an applet according to an embodiment of the present invention.
Description of reference numerals:
10-a mobile phone; 20-a base station; 30-a server; 40-a field terminal; 50-service handling terminal.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in detail below.
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the invention described herein are capable of operation in sequences other than those illustrated or described herein.
As shown in fig. 1, in the prior art, when queuing to take a number in places such as banks and hospitals, a number taking request is input through electronic devices such as a mobile phone 10 and a field terminal 40, the mobile phone 10 is connected to a server 30 through a base station 20, etc., the field terminal 40 is directly connected to the server 30, the server 30 processes the number taking request and outputs a number taking result, a worker reads information such as a number taking condition through a service handling terminal 50, and the service handling terminal 50 is directly connected to the server 30. When the server 30 processes the queuing request, the number is often called according to the time sequence of the queuing request, the number calling manner is simple, but the average use experience of the users is not good, for example, if two users are queued, the first user who gets the number needs one hour to handle the service, the second user needs only 10 minutes to handle the service, if the number is called according to the queuing sequence, the use experience of the second user is poor, but if the second user calls the number first and then the first user calls the number, although the queuing time of the first user is prolonged, the queuing time is only prolonged by 10 minutes, the actual use experience of the first user is not greatly affected, compared with the number calling according to the queuing sequence, the average use experience of the two users is improved.
As shown in fig. 2, a queuing and calling method provided in an embodiment of the present invention includes:
step S110, acquiring transaction requests of a plurality of users, wherein the transaction requests comprise start time and transaction items.
Specifically, the transaction requests can be input through reservation and number-taking operations, items to be transacted and the starting time are selected, the system can restrict the number of the transaction requests in one time period according to the number of actual transaction points, for example, if there are 7 transaction points transacting the same service, the transaction requests of 7 users can be transacted at most in the same time, and when the number of the transaction requests in one time period reaches 7, the transaction requests in the time period are not accepted.
And step S120, predicting transaction duration according to the transaction items, and determining ending time according to the starting time and the transaction duration.
Specifically, the average transaction duration of each transaction item can be determined according to the historical transaction conditions, the average transaction duration and the transaction items are stored in a one-to-one correspondence mode, the corresponding average transaction duration is directly read according to the acquired transaction items, the average transaction duration is the predicted transaction duration of the transaction items, and the ending time is obtained by adding the starting time and the predicted transaction duration.
Step S130, determining the transaction time periods of the transaction requests according to the starting time and the ending time, and distributing the transaction requests to the transaction points according to the transaction time periods based on a dynamic programming algorithm.
It should be noted that one transaction request may be regarded as one activity, and the process of allocating a transaction request to each transaction point separately may be regarded as an activity selection process. Assuming that there are n transaction requests, i.e., n activities, in a period of time, the set of all activities is S { a1, a2, ·, an }, where ai represents the ith activity, each activity has a start time and an end time, ai has a start time si, and end time fi, 0 ≦ si ≦ fi < ∞. When selected, ai occupies a half-open time interval [ si, fi). And if the time intervals [ si, fi) corresponding to ai and the time intervals [ sj, fj) corresponding to aj are not overlapped, the ai and the aj are compatible with each other. The assignment of an office request to an office point is to find the largest compatible subset in the current set, the active set for a time period as shown in table one.
Table activity set for a certain time period
| Activity i | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| Start time s | 1 | 3 | 0 | 5 | 3 | 5 | 6 | 8 | 8 | 2 | 12 |
| End time f | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 |
The activity set of Table one has 11 activities, and the maximum compatible subsets are { a1, a4, a8, a11} and { a2, a4, a9, a11 }.
Optionally, the allocating the transaction requests for the respective transaction points according to the start time and the end time based on the dynamic programming algorithm includes:
step S131, executing a dynamic planning algorithm for any time slot, wherein the dynamic planning algorithm comprises the step of determining all the transaction requests which are currently left in the time slot, and all the transaction requests which are currently left form an activity set.
Specifically, a suitable time period is selected, and if Sij is an active set compatible with ai and aj and ak is any activity in the active set Sij, fi is less than or equal to sk < fk < sj, and Sij is an active set corresponding to the time period between the time fi and the time sj.
Step S132, determining transaction time periods of the transaction requests according to the starting time and the ending time, and determining a maximum compatible subset in the activity set according to the time periods, wherein the maximum compatible subset comprises the transaction requests which are compatible with each other in pairs with the largest number, and the transaction time periods of any two transaction requests are not overlapped with each other to indicate that the two transaction requests are compatible.
Specifically, assuming that Aij is the maximum compatible subset of the active set Sij, and ak is any activity in Aij, the problem of solving the optimal solution of the active set Sij is solved, that is, determining the maximum compatible subset of the active set Sij can be split into sub-problems of respectively solving the optimal solutions of Aik and Akj, where Aij is Aik | ═ Akj { (ak }, and the number of activities in the optimal solution of the active set Sij is | Aij | ═ Aik | + | Akj | + 1.
It can be shown that Aij necessarily includes the optimal solutions of Aik and Akj by the following method, and assuming that Aij does not include the optimal solution of Aik, then Aik necessarily has an optimal solution Aik ', so that | Aik ' | > | Aik |, and further | Aik ' | + | Akj | +1> | Aik | + | Akj | +1 | Aij |, which conflicts with Aij being the maximum compatible subset of the active set Sij, so that the maximum compatible subset Aij necessarily includes the optimal solution of Aik, and similarly, it can be shown that Aij necessarily includes the optimal solution of Akj. Finding an ak in the active set converts the optimal solution problem for the active set Sij into a sub-problem for the optimal solution for Aik and Akj.
Optionally, the determining a maximum compatible subset in the active set according to the time period comprises:
and establishing a recursive formula according to the activity set and the time period.
Optionally, the establishing a recursive formula according to the active set and the time period comprises:
determining the recursive formula using a first formula, the first formula comprising:
where Sij represents the active set, c [ i ] [ j ] represents the number of the transaction requests included in the maximum compatible subset of the active set Sij, i represents the ith transaction request, k represents the kth transaction request, j represents the jth transaction request, c [ i ] [ k ] represents the number of the transaction requests included in the maximum compatible subset of the active set Sik, and c [ k ] [ j ] represents the number of the transaction requests included in the maximum compatible subset of the active set Skj.
Specifically, when Sij is an empty set, c [ i ] [ j ] ═ 0; when Sij is non-empty, if the maximum compatible subset of Sij includes the activity ak, then the maximum compatible subset Aij necessarily includes the active set Sik and the maximum compatible subset of the active set Skj, i.e., c [ i ] [ j ] ═ c [ i ] [ k ] + c [ k ] [ j ] + 1.
When i is larger than or equal to j, Sij is definitely an empty set, when one ak can be found, Sij is not empty (satisfying fi is smaller than or equal to sk and fk is smaller than or equal to sj), and when such ak cannot be found, Sij is an empty set.
And solving by adopting a bottom-up method according to the recursive formula to determine the maximum compatible subset.
Specifically, the bottom-up method means that the maximum compatible subsets of each subproblem are sequentially solved from the bottom layer to the top layer, the maximum compatible subset of the active set Sij is finally obtained, and a complex array ret [ n ] [ n ] can be introduced in the solving process to store the k value of the intermediate partition.
Optionally, the determining a maximum compatible subset in the active set according to the time period comprises:
and sequentially selecting the transaction requests with the earliest end time from top to bottom in the activity set based on a greedy algorithm until the end time of the transaction requests exceeds the time period or all the transaction requests are traversed, and obtaining the maximum compatible subset.
In particular, for any non-empty active set Sij, assuming am is the earliest activity in Sij to end, having the largest compatible subset of the active set Sij include the activity am, the subset Sim of the active set Sij is empty and selecting am will make the subset Smj of the active set Sij the only possible non-empty subset. Therefore, when solving the optimal solution of the activity set Sij, the activity am with the earliest end time in the Sij can be found first, am is added into the maximum compatible subset, all the remaining activity sets form Smj, then the activity with the earliest end time is found in Smj, and a recursive greedy algorithm or iteration is performed for multiple times to obtain the maximum compatible subset of the Sij.
Step S133, assigning all the office requests in the maximum compatible subset to one office point.
In this alternative embodiment, the transaction requests of the respective office points are determined by a dynamic programming and greedy algorithm within a time period, for example: and for the time period from 9 o 'clock to 10 o' clock, all the transaction requests of the reserved or number-taking transaction time period in the time period are acquired, and all the transaction requests are selected and distributed, so that the service transaction efficiency of each transaction point can be improved, and the use experience of a user is improved.
And step S134, recursively executing the dynamic programming algorithm until the transaction requests are distributed or the transaction requests are distributed to all the transaction requests.
Step S140, sequencing all the transaction requests of each transaction point in the sequence from short to long of the transaction duration to generate a calling sequence.
Optionally, the sorting all the transaction requests of the transaction points in the order of the transaction duration from short to long comprises:
and for any one of the transaction points, adopting a greedy algorithm, sequentially selecting the transaction requests with the shortest transaction duration from all the transaction requests of the transaction points, and generating the number calling sequence.
Specifically, for any office point, all office requests of the office point are sequentially arranged according to the sequence from short to long in office duration to generate a number calling sequence, a time period can be set according to actual conditions, and the average queuing time of a user can be reduced in the time period, so that the average use experience of the user is improved. For example, for a point of affairs, 4 users are queued between 9 o 'clock and 10 o' clock, the transaction duration of the first user a who gets a number is 10 minutes, the transaction duration of the second user b who gets a number is half an hour, the transaction duration of the third user c who gets a number is 15 minutes, the transaction duration of the fourth user d who gets a number is 5 minutes, if the number-calling transaction is performed according to the number-taking precedence order of the prior art, the queuing time of the user a is 0, the queuing time of the user b is 10 minutes, the queuing time of the user c is 40 minutes, the queuing time of the user d is 55 minutes, and the average queuing time of the four users is 26.25 minutes. In the time period, if the number is called from short to long according to the handling time, the first number is called by the user d, the queuing time is 0, the second number is called by the user a, the queuing time is 5 minutes, the third number is called by the user c, the queuing time is 15 minutes, the fourth number is called by the user b, the queuing time is 30 minutes, and the average queuing time of the four users is 15 minutes, so that the method can reduce the average queuing time of the users and improve the average service handling experience of the users. Although the queuing time of the user who first fetches a number may be prolonged, the service handling experience of the user who first fetches a number may be reduced as much as possible by adjusting the selected calibration time period, for example, the length of the calibration time period is shortened, so that the overall average experience of the user is improved.
In the embodiment, the transaction requests of a plurality of users are obtained, the transaction duration is predicted according to the input start time of the desired transaction and the items to be handled, the transaction time period of each transaction request is determined, the transaction requests are distributed to each transaction point by adopting a dynamic programming method according to the transaction time period of each transaction request, the distribution of the transaction requests is optimized, so that each transaction point can process more transaction requests in a calibration time period, the service transaction efficiency of each transaction point is improved, and the service transaction experience of the users is further improved. For each transaction point, the number calling sequence is generated according to the sequence of the transaction duration from short to long, the transaction requests with the short transaction duration can be preferentially processed in a calibration time period, the average queuing time of all users can be reduced, and the average service transaction experience of all users is improved.
As shown in fig. 3, a queuing and calling method based on an applet provided in an embodiment of the present invention includes:
step S210, acquiring transaction requests input by a plurality of users through the small programs, executing the queuing number calling method according to the transaction requests, determining the number calling sequence of each transaction point, respectively generating the queuing number of each user according to the number calling sequence, and feeding the queuing number back to the corresponding small program;
step S220, when detecting that the queuing number is extracted by the service handling terminal, generating the number calling information of the queuing number, and sending the number calling information to the corresponding small program.
In the embodiment, the user inputs the transaction request and receives the number calling information through the small program, and application software does not need to be additionally installed, so that the operation is simple and convenient. When detecting that the number of lining up is handled by the terminal extraction of handling of business, the presentation will handle the request of handling affairs of corresponding user, send the applet of calling out the number information to corresponding, remind the user to go to and handle the business, can realize noiselessly calling out the number, compare in calling out the number through on-the-spot report, also can accurately inform the user in noisy environment.
Optionally, the transaction request includes transaction items and login information, and after acquiring transaction requests input by a plurality of users through a applet, the method further includes:
determining whether the identity of the user needs to be verified according to the transaction items;
when the identity of the user needs to be verified, the identity of the user is verified according to the login information, and when the identity verification is successful, the queuing and calling method is executed according to the transaction items; when the identity authentication fails, returning authentication failure information;
when the identity of the user does not need to be verified, the queuing method is executed according to the transaction request.
In this optional embodiment, the applet may perform the number fetching and calling operations without installing a software program, and may adopt a wechat applet or a pay applet, and the identity verification may be implemented through an applet biometric authentication interface (wx.
As shown in fig. 4, a queuing and calling apparatus provided in an embodiment of the present invention includes:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring transaction requests of a plurality of users, and the transaction requests comprise starting time and transaction items;
the processing module is used for predicting the transaction duration according to the transaction items and determining the ending time according to the starting time and the transaction duration;
the planning module is used for determining the handling time periods of the handling requests according to the starting time and the ending time, and distributing the handling requests to the handling points according to the handling time periods based on a dynamic planning algorithm;
and the number calling module is used for sequencing all the transaction requests of each transaction point in the sequence from short to long in transaction duration to generate a number calling sequence.
As shown in fig. 5, an apparatus for queuing and calling based on an applet according to an embodiment of the present invention includes:
the queuing number generation module is used for acquiring transaction requests input by a plurality of users through the small programs, executing the queuing number calling method according to the transaction requests, determining the number calling sequence of each transaction point, respectively generating the queuing number of each user according to the number calling sequence, and feeding the queuing number back to the corresponding small program;
and the number calling information generating module is used for generating the number calling information of the queuing number when detecting that the queuing number is extracted by the service handling terminal, and sending the number calling information to the corresponding applet.
Another embodiment of the present invention provides a queuing and calling device, which includes a memory and a processor; the memory for storing a computer program; the processor is configured to implement the queuing and calling method as described above or the applet-based queuing and calling method as described above when the computer program is executed. The device comprises a computer, a server and the like.
Yet another embodiment of the present invention provides a computer-readable storage medium having stored thereon a computer program, which, when executed by a processor, implements the queuing method as described above or the applet-based queuing method as described above.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like. In this application, 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 of the present invention. 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, and can also be realized in a form of a software functional unit.
Although the present disclosure has been described above, the scope of the present disclosure is not limited thereto. Various changes and modifications may be effected therein by one of ordinary skill in the pertinent art without departing from the spirit and scope of the present disclosure, and these changes and modifications are intended to be within the scope of the present disclosure.
Claims (10)
1. A queuing and calling method is characterized by comprising the following steps:
acquiring transaction requests of a plurality of users, wherein the transaction requests comprise starting time and transaction items;
predicting the handling time length according to the handling items, and determining the ending time according to the starting time and the handling time length;
determining the handling time periods of the handling requests according to the starting time and the ending time, and distributing the handling requests to the handling points according to the handling time periods based on a dynamic programming algorithm;
and sequencing all the office requests of each office point in the order of the office duration from short to long to generate a number calling sequence.
2. The queuing number calling method of claim 1, wherein the allocating the transaction requests for each transaction point according to the start time and the end time based on a dynamic programming algorithm comprises:
executing a dynamic planning algorithm for any time period, wherein the dynamic planning algorithm comprises the steps of determining all the transaction requests which are currently left in the time period, and the all the transaction requests which are currently left form an activity set;
determining transaction time periods of the transaction requests according to the starting time and the ending time, and determining a maximum compatible subset in the active set according to the time periods, wherein the maximum compatible subset comprises the transaction requests which are compatible with each other in pairs with the largest number, and the transaction time periods of any two transaction requests are not overlapped with each other to indicate that the two transaction requests are compatible;
assigning all of the transaction requests in the maximum compatible subset to one of the transaction points;
the dynamic programming algorithm is recursively executed until the transaction requests are allocated or the transaction requests have been allocated for all of the transaction requests.
3. The method of claim 2, wherein said determining the maximum compatible subset in the active set according to the time period comprises:
establishing a recursion formula according to the activity set and the time period;
and solving by adopting a bottom-up method according to the recursive formula to determine the maximum compatible subset.
4. The queuing number calling method according to claim 3, wherein said establishing a recursive formula according to said active set and said time period comprises:
determining the recursive formula using a first formula, the first formula comprising:
where Sij represents the active set, c [ i ] [ j ] represents the number of the transaction requests included in the maximum compatible subset of the active set Sij, i represents the ith transaction request, k represents the kth transaction request, j represents the jth transaction request, c [ i ] [ k ] represents the number of the transaction requests included in the maximum compatible subset of the active set Sik, and c [ k ] [ j ] represents the number of the transaction requests included in the maximum compatible subset of the active set Skj.
5. The method of claim 2, wherein said determining the maximum compatible subset in the active set according to the time period comprises:
and sequentially selecting the transaction requests with the earliest end time from top to bottom in the activity set based on a greedy algorithm until the end time of the transaction requests exceeds the time period or all the transaction requests are traversed, and obtaining the maximum compatible subset.
6. A queuing number calling method as claimed in any one of claims 1 to 5 wherein said sorting all of said transaction requests of each of said transaction points in order of said transaction duration from short to long comprises:
and for any one of the transaction points, adopting a greedy algorithm, sequentially selecting the transaction requests with the shortest transaction duration from all the transaction requests of the transaction points, and generating the number calling sequence.
7. A queuing and calling method based on an applet is characterized by comprising the following steps:
acquiring transaction requests input by a plurality of users through a small program, executing the queuing and calling method according to any one of claims 1 to 6 according to the transaction requests, determining the calling sequence of each transaction point, respectively generating queuing numbers of the users according to the calling sequence, and feeding the queuing numbers back to the corresponding small program;
and when the queuing number is detected to be extracted by the service handling terminal, generating the number calling information of the queuing number, and sending the number calling information to the corresponding applet.
8. The applet-based queuing method according to claim 7, wherein the transaction request includes transaction and login information, and after obtaining transaction requests entered by a plurality of users via the applet, the method further comprises:
determining whether the identity of the user needs to be verified according to the transaction items;
when the identity of the user needs to be verified, verifying the identity of the user according to the login information, and when the identity verification is successful, executing the queuing and calling method according to any one of claims 1 to 6 according to the transaction item; when the identity authentication fails, returning authentication failure information;
when the identity of the user does not need to be verified, the queuing method according to any one of claims 1 to 6 is executed according to the transaction request.
9. An electronic device comprising a memory and a processor;
the memory for storing a computer program;
the processor, configured to implement the queuing method according to any one of claims 1 to 6 or the applet-based queuing method according to claim 7 or 8 when executing the computer program.
10. A computer-readable storage medium, characterized in that the storage medium has stored thereon a computer program which, when being executed by a processor, implements the queueing and calling method according to any one of claims 1 to 6 or the applet-based queueing and calling method according to claim 7 or 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011536798.3A CN112700582A (en) | 2020-12-23 | 2020-12-23 | Queuing and calling method, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011536798.3A CN112700582A (en) | 2020-12-23 | 2020-12-23 | Queuing and calling method, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112700582A true CN112700582A (en) | 2021-04-23 |
Family
ID=75509266
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011536798.3A Pending CN112700582A (en) | 2020-12-23 | 2020-12-23 | Queuing and calling method, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112700582A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI778679B (en) * | 2021-06-22 | 2022-09-21 | 臺北醫學科技股份有限公司 | Method for queuing and the related electronic device |
| TWI798158B (en) * | 2021-06-22 | 2023-04-01 | 臺北醫學科技股份有限公司 | Method for queuing and the related electronic device |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102779367A (en) * | 2012-07-13 | 2012-11-14 | 南京信息工程大学 | Scheduling method of queuing processing system and queuing machine for prediction of service processing time |
| CN104537752A (en) * | 2015-01-30 | 2015-04-22 | 浪潮软件股份有限公司 | Queuing method, cloud server and system |
| CN105006055A (en) * | 2015-08-05 | 2015-10-28 | 苏州经贸职业技术学院 | Multiwindow queuing and calling system and method |
| CN106652146A (en) * | 2016-11-14 | 2017-05-10 | 中国联合网络通信集团有限公司 | Multi-item queue processing method, server and mobile terminal |
| CN107392333A (en) * | 2017-06-30 | 2017-11-24 | 深圳前海弘稼科技有限公司 | Queuing strategy and line-up device |
| CN107958526A (en) * | 2017-11-20 | 2018-04-24 | 中国银行股份有限公司 | One kind is lined up processing method and processing device |
| CN108257283A (en) * | 2018-01-02 | 2018-07-06 | 甘肃万维信息技术有限责任公司 | A kind of E-Government queuing system |
| CN108537941A (en) * | 2018-03-30 | 2018-09-14 | 深圳市零度智控科技有限公司 | Bank queuing management method and system, server and storage medium |
| CN110570575A (en) * | 2019-09-12 | 2019-12-13 | 广州南翼信息科技有限公司 | Online queuing and calling system |
| CN111428899A (en) * | 2020-04-01 | 2020-07-17 | 中国银行股份有限公司 | Queuing and number calling method and device for network point service |
-
2020
- 2020-12-23 CN CN202011536798.3A patent/CN112700582A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102779367A (en) * | 2012-07-13 | 2012-11-14 | 南京信息工程大学 | Scheduling method of queuing processing system and queuing machine for prediction of service processing time |
| CN104537752A (en) * | 2015-01-30 | 2015-04-22 | 浪潮软件股份有限公司 | Queuing method, cloud server and system |
| CN105006055A (en) * | 2015-08-05 | 2015-10-28 | 苏州经贸职业技术学院 | Multiwindow queuing and calling system and method |
| CN106652146A (en) * | 2016-11-14 | 2017-05-10 | 中国联合网络通信集团有限公司 | Multi-item queue processing method, server and mobile terminal |
| CN107392333A (en) * | 2017-06-30 | 2017-11-24 | 深圳前海弘稼科技有限公司 | Queuing strategy and line-up device |
| CN107958526A (en) * | 2017-11-20 | 2018-04-24 | 中国银行股份有限公司 | One kind is lined up processing method and processing device |
| CN108257283A (en) * | 2018-01-02 | 2018-07-06 | 甘肃万维信息技术有限责任公司 | A kind of E-Government queuing system |
| CN108537941A (en) * | 2018-03-30 | 2018-09-14 | 深圳市零度智控科技有限公司 | Bank queuing management method and system, server and storage medium |
| CN110570575A (en) * | 2019-09-12 | 2019-12-13 | 广州南翼信息科技有限公司 | Online queuing and calling system |
| CN111428899A (en) * | 2020-04-01 | 2020-07-17 | 中国银行股份有限公司 | Queuing and number calling method and device for network point service |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI778679B (en) * | 2021-06-22 | 2022-09-21 | 臺北醫學科技股份有限公司 | Method for queuing and the related electronic device |
| TWI798158B (en) * | 2021-06-22 | 2023-04-01 | 臺北醫學科技股份有限公司 | Method for queuing and the related electronic device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109246229B (en) | Method and device for distributing resource acquisition request | |
| CN107423120B (en) | Task scheduling method and device | |
| US20210218842A1 (en) | Method, device, server and storage medium of agent allocation | |
| US7386850B2 (en) | Arrangement for scheduling tasks based on probability of availability of resources at a future point in time | |
| CN107231496B (en) | Traffic processing method, service processing method, device and server | |
| US7761323B2 (en) | Method and system for scheduling a customer service callback | |
| CN107748696B (en) | Task scheduling method and terminal equipment | |
| US20080144803A1 (en) | Dynamic agent skill balancing | |
| CN107682576B (en) | Customer incoming line distribution method, system, computer equipment and storage medium | |
| CN112700582A (en) | Queuing and calling method, electronic equipment and storage medium | |
| CN107590588A (en) | Method for allocating tasks, device and computer-readable recording medium | |
| CN107590002A (en) | Method for allocating tasks, device, storage medium, equipment and distributed task scheduling system | |
| CN104754153B (en) | Customer service system and its customer service method | |
| CN108958939B (en) | Service resource allocation method and device and server | |
| CN107800901B (en) | User call processing method, device, computer equipment and storage medium | |
| CN107682572B (en) | Customer incoming line distribution method, system, computer equipment and storage medium | |
| CN102668456A (en) | Method and system for adapting a session timeout period | |
| CN107888660B (en) | Cloud service resource allocation method, medium, device and computing equipment | |
| CN111080126B (en) | Task allocation method and device | |
| CN111985786A (en) | Agent-based task allocation method and device, computer equipment and storage medium | |
| CN112967091A (en) | Intelligent distribution method, system and storage medium for marketing service event | |
| CN111988478A (en) | Incoming call management method, device, server and storage medium | |
| CN111385294A (en) | Data processing method, system, computer device and storage medium | |
| CN111680914B (en) | Event distribution method, event distribution device, storage medium, and electronic device | |
| CN109583615A (en) | Booking method, system and server, the computer readable storage medium of meeting room |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20210423 |
|
| RJ01 | Rejection of invention patent application after publication |