CN113096295A

CN113096295A - Numbering method, numbering device, electronic equipment and computer readable storage medium

Info

Publication number: CN113096295A
Application number: CN202110369829.9A
Authority: CN
Inventors: 黄凤春
Original assignee: Industrial and Commercial Bank of China Ltd ICBC
Current assignee: Industrial and Commercial Bank of China Ltd ICBC
Priority date: 2021-04-06
Filing date: 2021-04-06
Publication date: 2021-07-09
Anticipated expiration: 2041-04-06
Also published as: CN113096295B

Abstract

The embodiment of the disclosure provides a numbering method, which is applied to the technical field of computers or other fields. The method comprises the following steps: acquiring a queuing request for a service to be processed, wherein the queuing request comprises the service type of the service to be processed; acquiring expected time corresponding to the service type of the service to be processed, wherein the expected time is time consumed by the service of the expected processing service type; determining a queuing queue corresponding to the service to be processed according to the expected time and the queuing queue determination condition; and generating a queuing serial number corresponding to the service to be processed according to the queuing number of the queuing queue corresponding to the service to be processed. The disclosure also provides a numbering device, an electronic device, a computer-readable storage medium and a computer program product.

Description

Numbering method, numbering device, electronic equipment and computer readable storage medium

Technical Field

The disclosed embodiments relate to the field of computer technologies, and more particularly, to a numbering method, a numbering device, an electronic device, a computer-readable storage medium, and a computer program product.

Background

The queuing system is a high and new technology product comprehensively utilizing computer, network, multimedia and communication control, replaces the traditional mode of standing and queuing by customers for various service windows, replaces the product of queuing by the computer system instead of the customers, and is suitable for various window service industries. The method is widely applied to industries such as finance, hospitals, telecommunication, external service windows of all levels of governments and the like.

Taking bank outlets as an example, the numbering system mainly adopts a first-come first-serve or short-job first-priority mode to realize numbering.

In the process of realizing the concept of the present disclosure, the inventor finds that at least the following problems exist in the related art, and the numbering mode adopted in the related art has low degree of intelligence and low numbering efficiency.

Disclosure of Invention

In view of the above, the disclosed embodiments provide a numbering method, a numbering device, an electronic device, a computer-readable storage medium, and a computer program product.

One aspect of the disclosed embodiments provides a numbering method, including:

acquiring a queuing request for a service to be processed, wherein the queuing request comprises a service type of the service to be processed;

acquiring expected time corresponding to the service type of the service to be processed, wherein the expected time is time consumed by the expected processing of the service type;

determining a queuing queue corresponding to the service to be processed according to the expected time and the queuing queue determination condition; and

and generating a queuing serial number corresponding to the service to be processed according to the queuing number of the queuing queue corresponding to the service to be processed.

According to an embodiment of the present disclosure, the determining, according to the expected time and the condition for determining a queue, a queue corresponding to the service to be processed includes:

and determining a queue corresponding to the service to be processed from M queues according to the expected time and a preset time threshold, wherein M is more than or equal to 2.

According to an embodiment of the present disclosure, the numbering method further comprises:

and determining the preset time threshold according to the number of queuing people of each queuing queue in the M queuing queues.

According to an embodiment of the present disclosure, determining a queue corresponding to the service to be processed from a plurality of queues according to the expected time and a preset time threshold includes:

under the condition that the expected time is smaller than a first preset time threshold value, determining that the queue corresponding to the service to be processed is a first queue;

under the condition that the expected time is determined to be greater than or equal to the first preset time threshold and smaller than a second preset time threshold, determining that the queue corresponding to the service to be processed is a second queue; and

and under the condition that the expected time is determined to be greater than or equal to the second preset time threshold, determining that the queue corresponding to the service to be processed is a third queue.

and updating the number of queuing people of the queuing queue corresponding to the service to be processed according to the queuing number corresponding to the service to be processed.

and under the condition that the service to be processed is processed according to the queuing sequence number corresponding to the service to be processed, adjusting the expected time of the service type corresponding to the service to be processed according to the actual time consumed by actually processing the service to be processed.

According to an embodiment of the present disclosure, the adjusting the expected time of the service type corresponding to the service to be processed according to the actual time consumed by actually processing the service to be processed includes:

and determining the actual time as a new expected time of a service type corresponding to the service to be processed under the condition that the absolute value of the difference between the actual time and the expected time is greater than or equal to a first difference threshold.

and under the condition that the service to be processed is processed according to the queuing number corresponding to the service to be processed, updating the queuing number of the queuing queue corresponding to the service to be processed.

under the condition that the updating condition aiming at the preset time threshold is met, acquiring the number of queuing people of other queuing queues in the M queuing queues and expected time corresponding to the other queuing queues; and

and adjusting the preset time threshold value according to the new expected time of the queue corresponding to the service to be processed, the number of queuing people of other queue and the expected time corresponding to other queue, so that the absolute value of the difference value of every two total times in the first total time and the M-1 second total time is less than or equal to the second difference threshold value, wherein the first total time is determined according to the new expected time of the queue corresponding to the service to be processed and the number of queuing people of the queue corresponding to the service to be processed, and each second total time is determined according to the number of queuing people of one queue in other queue and the expected time corresponding to the queue.

Another aspect of the disclosed embodiments provides a numbering device, including:

the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring a queuing request for a service to be processed, and the queuing request comprises a service type of the service to be processed;

a second obtaining module, configured to obtain expected time corresponding to a service type of the service to be processed, where the expected time is time consumed by the service of the service type to be processed;

the first determining module is used for determining a queuing queue corresponding to the service to be processed according to the expected time and the queuing queue determining condition; and

and the generating module is used for generating a queuing number corresponding to the service to be processed according to the queuing number of the queuing queue corresponding to the service to be processed.

Another aspect of an embodiment of the present disclosure provides an electronic device including: one or more processors; memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method as described above.

Another aspect of embodiments of the present disclosure provides a computer-readable storage medium storing computer-executable instructions for implementing the method as described above when executed.

Another aspect of an embodiment of the present disclosure provides a computer program product comprising computer executable instructions for implementing the method as described above when executed.

According to the embodiment of the disclosure, the queuing queue corresponding to the service to be processed is determined according to the expected time corresponding to the service type of the service to be processed and the queuing queue determination condition, and the queuing number corresponding to the service to be processed is generated according to the queuing number of the queuing queue corresponding to the service to be processed. The queuing queue corresponding to the service to be processed is determined according to the expected time corresponding to the service to be processed and the queuing queue determination condition, so that the service is shunted according to the expected time consumed by the expected processing service, the service to be processed can be effectively ensured to be processed in reasonable time, and the queuing efficiency is improved. The problems of low intelligent degree and low queuing efficiency of a queuing system in the prior art are solved.

Drawings

The above and other objects, features and advantages of the present disclosure will become more apparent from the following description of embodiments of the present disclosure with reference to the accompanying drawings, in which:

fig. 1 schematically illustrates an exemplary system architecture to which the numbering method may be applied, according to an embodiment of the present disclosure.

Fig. 2 schematically illustrates a flow chart of a numbering process according to an embodiment of the present disclosure.

Fig. 3 schematically shows a flow chart of a numbering process according to another embodiment of the present disclosure.

Fig. 4 schematically shows a block diagram of a numbering device according to an embodiment of the present disclosure.

Fig. 5 schematically shows a block diagram of an electronic device adapted to implement the numbering process according to an embodiment of the present disclosure.

Detailed Description

Hereinafter, embodiments of the present disclosure will be described with reference to the accompanying drawings. It should be understood that the description is illustrative only and is not intended to limit the scope of the present disclosure. In the following detailed description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the disclosure. It may be evident, however, that one or more embodiments may be practiced without these specific details. Moreover, in the following description, descriptions of well-known structures and techniques are omitted so as to not unnecessarily obscure the concepts of the present disclosure.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. The terms "comprises," "comprising," and the like, as used herein, specify the presence of stated features, steps, operations, and/or components, but do not preclude the presence or addition of one or more other features, steps, operations, or components.

All terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art unless otherwise defined. It is noted that the terms used herein should be interpreted as having a meaning that is consistent with the context of this specification and should not be interpreted in an idealized or overly formal sense.

Where a convention analogous to "at least one of A, B and C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B and C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.). Where a convention analogous to "A, B or at least one of C, etc." is used, in general such a construction is intended in the sense one having skill in the art would understand the convention (e.g., "a system having at least one of A, B or C" would include but not be limited to systems that have a alone, B alone, C alone, a and B together, a and C together, B and C together, and/or A, B, C together, etc.).

The queuing system can replace the traditional mode of standing by a customer and queuing by various service windows, and the computer system replaces the products queued by the customer. The method is widely applied to industries such as finance, hospitals, telecommunication, external service windows of all levels of governments and the like.

Taking a bank network as an example, the numbering system of the bank network mainly adopts a scheduling strategy of 'First Come First Serve (FCFS)' and 'star user priority' and a method for individual and public service distribution.

In the course of implementing the disclosed concept, the inventor finds that, in the same star level user, the numbering system of the bank network only considers the time point of the client for taking the number, and does not consider the time required by the business handled by the client and the waiting time for the business. For example, there may be a phenomenon that A, B, C, D, E with 5 clients take numbers successively, the time interval is 5 seconds, the time required for the service they need to handle is 50 minutes, 40 minutes, 30 minutes, 10 minutes and 5 minutes, and according to the existing numbering method, assuming that only one window is used for handling the service, the time required for the service they need to wait is 0 minutes, 50 minutes, 90 minutes, 120 minutes and 130 minutes, respectively, and the total waiting time is 390 minutes. If the ratio of the waiting time to the service time is taken as the service time cost of the client, the service time cost of 5 clients is 0, 1.25, 3, 12 and 26 respectively. For the clients, the number is taken in sequence, the clients are served first, and the waiting time of 5 clients is increased fairly and reasonably. However, comparing clients a and E, although the difference between the number taking time and the waiting time is only 20 seconds, the waiting time is 130 minutes, and the number ranking method cannot be absolutely considered as fair. Thus, the current numbering method is not necessarily optimal for banking outlets in such situations.

Assuming that the queuing method is based on a scheduling policy of "Short Job First (SJF)", then the service order of the 5 clients of A, B, C, D, E is E, D, C, B, A, the time they need to wait is 0 min, 5 min, 15 min, 45 min, 85 min, the total wait time is 150 min, and the time cost is 0, 0.5, 1, 1.7. Compared with the numbering system adopting the numbering method of 'first come first serve', the total waiting time of 390 minutes of the client is reduced to 150 minutes, the waiting time of C, D, E is greatly shortened, the waiting time of B is also shortened by 5 minutes, and the time cost of four people is reduced to be within 1. In other words, the waiting time of the client can be greatly shortened by adopting the method. However, although the waiting time of B, C, D, E is shortened for four people, the waiting time of A is increased from 0 minute to 85 minutes, which is also unfair to A.

Therefore, the existing queuing system has low intelligent degree, and has the problem of low queuing efficiency under the condition of ensuring that each user can be treated fairly.

Embodiments of the present disclosure provide a numbering method, a numbering device, an electronic device, a computer-readable storage medium, and a computer program product. The numbering method, the numbering device, the electronic device, the computer-readable storage medium and the computer program product of the embodiments of the disclosure may be applied to the field of computer technology, and may also be applied to any field except the field of computer technology, which is not limited by the embodiments of the disclosure. The numbering method comprises the steps of obtaining a numbering request aiming at a service to be processed, wherein the numbering request comprises the service type of the service to be processed; acquiring expected time corresponding to the service type of the service to be processed, wherein the expected time is time consumed by the service of the expected processing service type; determining a queuing queue corresponding to the service to be processed according to the expected time and the queuing queue determination condition; and generating a queuing serial number corresponding to the service to be processed according to the queuing number of the queuing queue corresponding to the service to be processed.

Fig. 1 schematically illustrates an exemplary system architecture 100 to which the numbering method may be applied, according to an embodiment of the disclosure. It should be noted that fig. 1 is only an example of a system architecture to which the embodiments of the present disclosure may be applied to help those skilled in the art understand the technical content of the present disclosure, and does not mean that the embodiments of the present disclosure may not be applied to other devices, systems, environments or scenarios.

As shown in fig. 1, the system architecture 100 according to this embodiment may include

terminal devices

101, 102, 103, a network 104 and a server 105. The network 104 serves as a medium for providing communication links between the

terminal devices

101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired and/or wireless communication links, and so forth.

The user may use the

terminal devices

101, 102, 103 to interact with the server 105 via the network 104 to receive or send messages or the like. The

terminal devices

101, 102, 103 may have installed thereon various communication client applications, such as a shopping-like application, a web browser application, a search-like application, an instant messaging tool, a mailbox client, and/or social platform software, etc. (by way of example only).

The

terminal devices

101, 102, 103 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.

The server 105 may be a server providing various services, such as a background management server (for example only) providing support for websites browsed by users using the

terminal devices

101, 102, 103. The background management server may analyze and perform other processing on the received data such as the user request, and feed back a processing result (e.g., a webpage, information, or data obtained or generated according to the user request) to the terminal device.

It should be noted that the numbering method provided by the embodiments of the present disclosure may be generally performed by the server 105. Accordingly, the numbering device provided by the embodiments of the present disclosure may be generally disposed in the server 105. The numbering method provided by the embodiments of the present disclosure may also be performed by a server or a cluster of servers different from the server 105 and capable of communicating with the

terminal devices

101, 102, 103 and/or the server 105. Accordingly, the numbering device provided by the embodiment of the present disclosure may also be disposed in a server or a server cluster different from the server 105 and capable of communicating with the

terminal devices

101, 102, 103 and/or the server 105. Alternatively, the numbering method provided by the embodiment of the present disclosure may also be executed by the

terminal device

101, 102, or 103, or may also be executed by another terminal device different from the

terminal device

101, 102, or 103. Accordingly, the numbering provided by the embodiment of the present disclosure may also be provided in the

terminal device

101, 102, or 103, or in another terminal device different from the

terminal device

101, 102, or 103.

For example, the pending queuing request may be originally obtained by any one of the

terminal devices

101, 102, or 103 (for example, but not limited to, the terminal device 101), or may be obtained by an external terminal device and then imported into the terminal device 101. Then, the terminal device 101 may locally execute the queuing method provided by the embodiment of the present disclosure, or send the pending queuing request to another terminal device, server, or server cluster, and execute the queuing method provided by the embodiment of the present disclosure by another terminal device, server, or server cluster that receives the pending queuing request.

It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.

As shown in fig. 2, the method includes operations S201 to S204.

In operation S201, a queuing request for a service to be processed is obtained, where the queuing request includes a service type of the service to be processed.

According to the embodiment of the disclosure, the to-be-processed service may include a service that needs to be numbered in each industry, and the service type may include a category to which the to-be-processed service belongs.

For example, taking the pending service as a banking service and the queuing system as a queuing system of a banking outlet as an example, the pending service may include a deposit service, a withdrawal service, a credit loan service, an account opening service, and the like of a certain user.

According to the embodiment of the disclosure, the queuing request can include that the user performs corresponding trigger operation generation at the personal intelligent terminal or the service point terminal. The personal intelligent terminal comprises an electronic device, the electronic device can comprise a terminal device, and the terminal device can comprise a smart phone, a tablet computer, a portable computer or a desktop computer and the like. The point-of-service terminal may comprise an electronic device, which may comprise a queuing machine or the like. The trigger operation may include a click or a slide, etc.

For example, taking a pending service as a certain banking service and a queuing system as a queuing system of a banking outlet as an example, a user may operate a certain service on a smart phone to generate a queuing request, and the smart phone sends the queuing request to the queuing system of the banking outlet. Or, the user may operate on a queuing machine of a banking outlet for a certain service, generate a queuing request, and then send the queuing request to a queuing system of the banking outlet.

In operation S202, an expected time corresponding to a service type of a service to be processed is obtained, where the expected time is a time consumed by processing the service of the service type in an expected manner.

In operation S203, a queue corresponding to the service to be processed is determined according to the expected time and the queue determination condition.

According to an embodiment of the present disclosure, the queue-queuing determination condition may include a time range or a time threshold, or the like.

For example, taking the queue-queuing determination condition as an example of the time range, the time range may include within 10 minutes, 10 minutes to 20 minutes, and 20 minutes or more. The method can be divided into a class a queuing queue, a class B queuing queue and a class C queuing queue according to the three time ranges, wherein the class a queuing queue includes services with an expected time within 10 minutes, the class B queuing queue includes services with an expected time of 10 minutes to 20 minutes, and the class C queuing queue includes services with an expected time of more than 20 minutes.

As another example, taking the queue determination condition as the time threshold, the time threshold may include, for example, 10 minutes and 20 minutes. According to the two time thresholds, the queue can be divided into a class D queue, a class E queue and a class F queue, wherein the class D queue comprises services whose expected time does not meet the time threshold of 10 minutes, the class E queue comprises services whose expected time meets the time threshold of 10 minutes but does not meet the time threshold of 20 minutes, and the class F queue comprises services whose expected time meets the time threshold of 20 minutes.

It should be noted that the above embodiments are only exemplary embodiments, and the queue determining condition may also be other time ranges or time thresholds according to specific implementation needs.

In operation S204, a queuing number corresponding to the service to be processed is generated according to the number of queuing people in the queuing queue corresponding to the service to be processed.

According to the embodiment of the disclosure, each queuing queue determining condition corresponds to one queuing queue, and the queuing number can be generated in an order mode according to the queuing number of the queuing queue corresponding to the service to be processed.

For example, taking the queuing queue including a class a queuing queue, a class B queuing queue, and a class C queuing queue as an example, the queuing queue corresponding to the service to be processed is a class a queuing queue, and if the number of queuing people in the class a queuing queue is N, and N ≧ 0, the generated queuing number is N + 1.

According to the embodiment of the disclosure, the dispatching and queuing are performed through the multi-stage queues, so that clients can queue according to service duration, and the condition of fast service queuing is avoided.

It should be noted that the method for generating a queuing number is only an exemplary embodiment, and other methods for generating a queuing number that can achieve the same technical effect may be used according to specific implementation needs.

According to the embodiment of the disclosure, determining a queue corresponding to a service to be processed according to an expected time and a queue determining condition includes: and determining a queue corresponding to the service to be processed from M queues according to the expected time and a preset time threshold, wherein M is more than or equal to 2.

According to an embodiment of the present disclosure, the preset time threshold may include L, where L ≧ 1, and the queue divided according to the L preset time thresholds may include M, where M ═ L + 1.

For example, the preset time threshold may include two time thresholds, where the two time thresholds respectively include 10 minutes and 20 minutes, the queue may be divided into three queues according to the two time thresholds, and the queues are respectively a class D queue, a class E queue, and a class F queue, where the class D queue includes services whose expected time does not satisfy the time threshold of 10 minutes, the class E queue includes services whose expected time satisfies the time threshold of 10 minutes but does not satisfy the time threshold of 20 minutes, and the class F queue includes services whose expected time satisfies the time threshold of 20 minutes.

According to an embodiment of the present disclosure, the numbering method further comprises: and determining a preset time threshold according to the number of queuing people of each queuing queue in the M queuing queues.

According to the embodiment of the disclosure, in order to balance the service processing time in each queue, the expected processing time of each queue is calculated according to the number of queuing people of each queue and the expected time of each service. The number of queued people in each queue is adjusted until the expected processing time for each queue is approximately equal or completely equal. And determining a preset time threshold according to the adjusted expected time of the service in each queue.

According to the embodiment of the disclosure, determining a queue corresponding to a service to be processed from a plurality of queues according to an expected time and a preset time threshold includes:

under the condition that the expected time is smaller than a first preset time threshold value, determining that a queue corresponding to the service to be processed is a first queue; under the condition that the expected time is determined to be greater than or equal to a first preset time threshold and less than a second preset time threshold, determining a queuing queue corresponding to the service to be processed as a second queuing queue; and under the condition that the expected time is determined to be greater than or equal to a second preset time threshold, determining that the queue corresponding to the service to be processed is a third queue.

According to the embodiment of the disclosure, the number is scheduled through the multi-stage queue, the number scheduling time of a few long-time service clients is sacrificed, the number scheduling time of a majority of short-time service clients is shortened, the number scheduling efficiency is reduced less obviously for the long-time service clients, and the number scheduling efficiency can be obviously improved for the short-time clients.

According to an embodiment of the present disclosure, the preset time threshold may include two, including a first preset time threshold and a second preset time threshold, respectively. The queuing queue can be divided into three queues according to two preset time thresholds, wherein the three queues respectively comprise a first queuing queue, a second queuing queue and a third queuing queue.

It should be noted that the above embodiments are only exemplary embodiments, and any other number of time thresholds may be used according to specific implementation requirements.

According to an embodiment of the present disclosure, the numbering method further comprises: and updating the number of queuing people of the queuing queue corresponding to the service to be processed according to the queuing number corresponding to the service to be processed.

According to an embodiment of the present disclosure, the numbering method further comprises: and under the condition that the service to be processed is processed according to the queuing number corresponding to the service to be processed, adjusting the expected time of the service type corresponding to the service to be processed according to the actual time consumed by actually processing the service to be processed.

According to the embodiment of the present disclosure, adjusting the expected time of the service type corresponding to the service to be processed according to the actual time consumed by actually processing the service to be processed includes: and determining the actual time as a new expected time of the service type corresponding to the service to be processed under the condition that the absolute value of the difference value between the actual time and the expected time is greater than or equal to a first difference threshold value.

According to an embodiment of the present disclosure, the first difference threshold may include 5 minutes, 7 minutes, and the like, and taking the first difference threshold as 5 minutes as an example, if a difference between an actual time consumed for processing a certain service and an expected time of the service is greater than 5 minutes, the actual time is updated to the expected time of the service. And if the difference between the actual time consumed for processing a certain service and the expected time of the service is less than 5 minutes, not updating the expected time of the service.

It should be noted that the foregoing embodiments are only exemplary embodiments, and the first difference threshold may include any time threshold according to specific implementation needs.

According to the embodiment of the disclosure, algorithm parameters are updated in real time according to actual service processing time and the number of queuing people, and a queuing system is automatically adjusted, so that intelligent queuing is realized.

According to an embodiment of the present disclosure, the numbering method further comprises: and under the condition that the service to be processed is processed according to the queuing number corresponding to the service to be processed, updating the queuing number of the queuing queue corresponding to the service to be processed.

As shown in fig. 3, the numbering method includes operations S301 to S302.

In operation S301, in the case that the update condition for the preset time threshold is satisfied, the number of queuing people of other queuing queues and the expected time corresponding to the other queuing queues are acquired from the M queuing queues.

According to an embodiment of the present disclosure, the update condition for the preset time threshold may be set according to actual situations, and is not limited herein. Optionally, the update condition for the preset time threshold may include that a preset number of people in line is increased or the update time is reached within a preset time period. The other queuing queues of the M queuing queues may refer to other queuing queues except the queuing queue corresponding to the service to be processed.

In operation S302, a preset time threshold is adjusted according to a new expected time of a queue corresponding to a service to be processed, the number of queuing people of the queue corresponding to the service to be processed, the number of queuing people of other queues, and expected times corresponding to other queues, so that an absolute value of a difference between every two total times of a first total time and M-1 second total times is less than or equal to the second difference threshold, where the first total time is determined according to the new expected time of the queue corresponding to the service to be processed and the number of queuing people of the queue corresponding to the service to be processed, and each second total time is determined according to the number of queuing people of one queue of the other queues and the expected time corresponding to the queue.

According to an embodiment of the present disclosure, each queue has a corresponding total time, and each traffic type has a corresponding queue. In order to ensure that the total time for processing the services of various service types is approximately the same as much as possible, the method can be realized by adjusting the preset time threshold value, namely, the difference value between the total time corresponding to each queuing queue and the total time corresponding to any other queuing queue is smaller than or equal to the second difference threshold value. The value of the second difference threshold may be set according to actual conditions, and is not limited herein. The total time corresponding to each queue may be the product of the number of people queued for the queue and the expected time corresponding to the queue. In the embodiment of the present disclosure, the total time of the queue corresponding to the service to be processed is referred to as a first total time, and the total time corresponding to each of the other queues is referred to as a second total time. For example, the preset time threshold may include a first preset time threshold and a second preset time threshold. And M is 3, namely 3 queuing queues, namely a first queuing queue, a second queuing queue and a third queuing queue are included. The queue corresponding to the service to be processed is a first queue. The expected time corresponding to the first queue is set to be T1, the expected time corresponding to the second queue is set to be T2, the expected time corresponding to the third queue is set to be T3, the number of queuing people corresponding to the first queue is set to be N1, the number of queuing people corresponding to the second queue is set to be N2, the number of queuing people corresponding to the third queue is set to be N3, the total time corresponding to the first queue is set to be S1-T1 x N1, the total time corresponding to the second queue is set to be S2-T2 x N2, and the total time corresponding to the third queue is set to be S3-T3 x N3. The first predetermined time threshold is Tth1, and the second predetermined time threshold is Tth 2. The second difference threshold is Td 1. S1-S2 is more than or equal to Td1, and S3-S2 is more than or equal to Td 1.

According to the embodiment of the disclosure, since S1-S2 is more than or equal to Td1 and S3-S2 is more than or equal to Td1, Tth1 can be reduced and Tth2 can be increased to increase the number of queuing people corresponding to the second queuing queue and reduce the number of queuing people corresponding to the first queuing queue and the third queuing people.

Fig. 4 schematically shows a block diagram of a numbering device 400 according to an embodiment of the present disclosure.

As shown in fig. 4, the numbering device 400 includes a first obtaining module 401, a second obtaining module 402, a first determining module 403, and a generating module 404.

A first obtaining module 401, configured to obtain a queuing request for a service to be processed, where the queuing request includes a service type of the service to be processed;

a second obtaining module 402, configured to obtain expected time corresponding to a service type of a service to be processed, where the expected time is time consumed by the service of the expected processing service type;

a first determining module 403, configured to determine, according to the expected time and the queuing determination condition, a queuing queue corresponding to the service to be processed; and

the generating module 404 is configured to generate a queuing number corresponding to the service to be processed according to the number of queuing people in the queuing queue corresponding to the service to be processed.

According to an embodiment of the present disclosure, the first determination module 403 includes a first determination unit.

The first determining unit is used for determining a queuing queue corresponding to the service to be processed from M queuing queues according to the expected time and a preset time threshold, wherein M is more than or equal to 2.

According to an embodiment of the present disclosure, the numbering device 400 further comprises a second determining module.

And the second determining module is used for determining a preset time threshold according to the number of queuing people of each queuing queue in the M queuing queues.

According to an embodiment of the present disclosure, the first determination unit includes a first determination subunit, a second determination subunit, and a third determination subunit.

The first determining subunit is configured to determine, when it is determined that the expected time is smaller than a first preset time threshold, that the queue corresponding to the service to be processed is a first queue.

And the second determining subunit is used for determining that the queue corresponding to the service to be processed is a second queue under the condition that the expected time is determined to be greater than or equal to the first preset time threshold and less than a second preset time threshold.

And the third determining subunit is configured to determine, as the third queue, the queue corresponding to the service to be processed when it is determined that the expected time is greater than or equal to the second preset time threshold.

According to an embodiment of the present disclosure, the queuing apparatus 400 further includes a first updating module.

And the first updating module is used for updating the queuing number of the queuing queue corresponding to the service to be processed according to the queuing number corresponding to the service to be processed.

According to an embodiment of the present disclosure, the numbering device 400 further comprises a first adjusting module.

And the first adjusting module is used for adjusting the expected time of the service type corresponding to the service to be processed according to the actual time consumed by actually processing the service to be processed under the condition that the service to be processed is processed according to the queuing number corresponding to the service to be processed.

According to an embodiment of the present disclosure, the adjustment module includes a second determination unit.

And the second determining unit is used for determining the actual time as the new expected time of the service type corresponding to the service to be processed under the condition that the absolute value of the difference between the actual time and the expected time is determined to be greater than or equal to the first difference threshold.

According to an embodiment of the present disclosure, the queuing apparatus 400 further includes a second updating module.

And the second updating module is used for updating the queuing number of the queuing queue corresponding to the service to be processed under the condition that the service to be processed is processed according to the queuing number corresponding to the service to be processed.

According to an embodiment of the present disclosure, the queuing apparatus 400 further includes an obtaining module and a second adjusting module.

The obtaining module is used for obtaining the number of queuing people of other queuing queues in the M queuing queues and the expected time corresponding to the other queuing queues under the condition that the updating condition aiming at the preset time threshold is met.

And the second adjusting module is used for adjusting the preset time threshold value according to the new expected time of the queue corresponding to the service to be processed, the number of queuing people of other queue and the expected time corresponding to other queue, so that the absolute value of the difference value of every two total times in the first total time and the M-1 second total time is less than or equal to the second difference threshold value, wherein the first total time is determined according to the new expected time of the queue corresponding to the service to be processed and the number of queuing people of the queue corresponding to the service to be processed, and each second total time is determined according to the number of queuing people of one queue in other queue and the expected time corresponding to the queue.

Any number of modules, sub-modules, units, sub-units, or at least part of the functionality of any number thereof according to embodiments of the present disclosure may be implemented in one module. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented by being split into a plurality of modules. Any one or more of the modules, sub-modules, units, and sub-units according to the embodiments of the present disclosure may be implemented at least partially as a hardware Circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented by hardware or firmware in any other reasonable manner of integrating or packaging a Circuit, or implemented by any one of three implementations of software, hardware, and firmware, or any suitable combination of any of them. Alternatively, one or more of the modules, sub-modules, units, sub-units according to embodiments of the disclosure may be at least partially implemented as a computer program module, which when executed may perform the corresponding functions.

For example, any plurality of the first obtaining module 401, the second obtaining module 402, the first determining module 403 and the generating module 404 may be combined and implemented in one module/unit/sub-unit, or any one of the modules/units/sub-units may be split into a plurality of modules/units/sub-units. Alternatively, at least part of the functionality of one or more of these modules/units/sub-units may be combined with at least part of the functionality of other modules/units/sub-units and implemented in one module/unit/sub-unit. According to an embodiment of the present disclosure, at least one of the first obtaining module 401, the second obtaining module 402, the first determining module 403, and the generating module 404 may be at least partially implemented as a hardware circuit, such as a Field Programmable Gate Array (FPGA), a Programmable Logic Array (PLA), a system on a chip, a system on a substrate, a system on a package, an Application Specific Integrated Circuit (ASIC), or may be implemented by hardware or firmware in any other reasonable manner of integrating or packaging a circuit, or implemented by any one of three implementations of software, hardware, and firmware, or by a suitable combination of any of them. Alternatively, at least one of the first obtaining module 401, the second obtaining module 402, the first determining module 403 and the generating module 404 may be at least partially implemented as a computer program module, which when executed may perform a corresponding function.

It should be noted that, the numbering device portion in the embodiment of the present disclosure corresponds to the numbering method portion in the embodiment of the present disclosure, and the description of the numbering device portion specifically refers to the numbering method portion, which is not repeated herein.

Fig. 5 schematically shows a block diagram of an electronic device adapted to implement the above described method according to an embodiment of the present disclosure. The electronic device shown in fig. 5 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.

As shown in fig. 5, an electronic device 500 according to an embodiment of the present disclosure includes a processor 501, which can perform various appropriate actions and processes according to a program stored in a Read-Only Memory (ROM) 502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. The processor 501 may comprise, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or associated chipset, and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), among others. The processor 501 may also include onboard memory for caching purposes. Processor 501 may include a single processing unit or multiple processing units for performing different actions of a method flow according to embodiments of the disclosure.

In the RAM503, various programs and data necessary for the operation of the electronic apparatus 500 are stored. The processor 501, the ROM 502, and the RAM503 are connected to each other by a bus 504. The processor 501 performs various operations of the method flows according to the embodiments of the present disclosure by executing programs in the ROM 502 and/or the RAM 503. Note that the program may also be stored in one or more memories other than the ROM 502 and the RAM 503. The processor 501 may also perform various operations of method flows according to embodiments of the present disclosure by executing programs stored in one or more memories.

According to an embodiment of the present disclosure, electronic device 500 may also include an input/output (I/O) interface 505, input/output (I/O) interface 505 also being connected to bus 504. The electronic device 500 may also include one or more of the following components connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a Display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.

According to embodiments of the present disclosure, method flows according to embodiments of the present disclosure may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable storage medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program, when executed by the processor 501, performs the above-described functions defined in the system of the embodiments of the present disclosure. The systems, devices, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.

The present disclosure also provides a computer-readable storage medium, which may be contained in the apparatus/device/system described in the above embodiments; or may exist separately and not be assembled into the device/apparatus/system. The computer-readable storage medium carries one or more programs which, when executed, implement the method according to an embodiment of the disclosure.

According to an embodiment of the present disclosure, the computer-readable storage medium may be a non-volatile computer-readable storage medium. Examples may include, but are not limited to: a portable Computer diskette, a hard disk, a Random Access Memory (RAM), a Read-Only Memory (ROM), an Erasable Programmable Read-Only Memory (EPROM) or flash Memory), a portable compact Disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the preceding. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

For example, according to embodiments of the present disclosure, a computer-readable storage medium may include ROM 502 and/or RAM503 and/or one or more memories other than ROM 502 and RAM503 described above.

Embodiments of the present disclosure also include a computer program product comprising a computer program containing program code for performing the method provided by the embodiments of the present disclosure, when the computer program product is run on an electronic device, the program code being adapted to cause the electronic device to carry out the numbering method provided by the embodiments of the present disclosure.

The computer program, when executed by the processor 501, performs the above-described functions defined in the system/apparatus of the embodiments of the present disclosure. The systems, apparatuses, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the present disclosure.

In one embodiment, the computer program may be hosted on a tangible storage medium such as an optical storage device, a magnetic storage device, or the like. In another embodiment, the computer program may also be transmitted, distributed in the form of a signal on a network medium, downloaded and installed through the communication section 509, and/or installed from the removable medium 511. The computer program containing program code may be transmitted using any suitable network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.

In accordance with embodiments of the present disclosure, program code for executing computer programs provided by embodiments of the present disclosure may be written in any combination of one or more programming languages, and in particular, these computer programs may be implemented using high level procedural and/or object oriented programming languages, and/or assembly/machine languages. The programming language includes, but is not limited to, programming languages such as Java, C + +, python, the "C" language, or the like. The program code may execute entirely on the user computing device, partly on the user device, partly on a remote computing device, or entirely on the remote computing device or server. In situations involving remote computing devices, the remote computing devices may be connected to the user computing device through any kind of Network, including a Local Area Network (LAN) or Wide Area Network (WAN), or may be connected to external computing devices (e.g., through the internet using an internet service provider).

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. Those skilled in the art will appreciate that various combinations and/or combinations of features recited in the various embodiments and/or claims of the present disclosure can be made, even if such combinations or combinations are not expressly recited in the present disclosure. In particular, various combinations and/or combinations of the features recited in the various embodiments and/or claims of the present disclosure may be made without departing from the spirit or teaching of the present disclosure. All such combinations and/or associations are within the scope of the present disclosure.

The embodiments of the present disclosure have been described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described separately above, this does not mean that the measures in the embodiments cannot be used in advantageous combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be devised by those skilled in the art without departing from the scope of the present disclosure, and such alternatives and modifications are intended to be within the scope of the present disclosure.

Claims

1. A numbering process comprising:

2. The method according to claim 1, wherein the determining a queue corresponding to the service to be processed according to the expected time and queue determination condition comprises:

3. The method of claim 2, further comprising:

4. The method according to claim 2, wherein the determining, according to the expected time and a preset time threshold, a queue corresponding to the to-be-processed service from a plurality of queues includes:

5. The method of claim 1, further comprising:

6. The method of claim 2, further comprising:

7. The method of claim 6, wherein the adjusting the expected time of the traffic type corresponding to the to-be-processed traffic according to the actual time consumed by actually processing the to-be-processed traffic comprises:

8. The method of claim 6, further comprising:

9. The method of claim 8, further comprising:

10. A queuing apparatus comprising:

11. An electronic device, comprising:

one or more processors;

a memory for storing one or more programs,

wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method of any of claims 1-9.

12. A computer readable storage medium having stored thereon executable instructions which, when executed by a processor, cause the processor to carry out the method of any one of claims 1 to 9.

13. A computer program product comprising a computer program which, when executed by a processor, is adapted to carry out the method of any one of claims 1 to 9.