CN115619114A - Numbering method, numbering device, electronic equipment and computer readable storage medium - Google Patents
Numbering method, numbering device, electronic equipment and computer readable storage medium Download PDFInfo
- Publication number
- CN115619114A CN115619114A CN202210531089.9A CN202210531089A CN115619114A CN 115619114 A CN115619114 A CN 115619114A CN 202210531089 A CN202210531089 A CN 202210531089A CN 115619114 A CN115619114 A CN 115619114A
- Authority
- CN
- China
- Prior art keywords
- queuing
- service
- sequence number
- weight
- user
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06316—Sequencing of tasks or work
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07C—TIME OR ATTENDANCE REGISTERS; REGISTERING OR INDICATING THE WORKING OF MACHINES; GENERATING RANDOM NUMBERS; VOTING OR LOTTERY APPARATUS; ARRANGEMENTS, SYSTEMS OR APPARATUS FOR CHECKING NOT PROVIDED FOR ELSEWHERE
- G07C11/00—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere
- G07C2011/04—Arrangements, systems or apparatus for checking, e.g. the occurrence of a condition, not provided for elsewhere related to queuing systems
Abstract
The invention discloses a numbering method, a numbering device, electronic equipment and a computer readable storage medium, wherein the method comprises the steps of receiving a numbering request, wherein the numbering request comprises a service name; acquiring corresponding service handling time according to the service name; and generating a queuing sequence number according to the queuing sequence number and the service handling time, wherein the queuing sequence number is used for preferentially calling the number of the user with the service handling time. The invention can reduce the waiting time of the user for a long service handling time and improve the queuing experience of the user.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, 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, and replaces the product of queuing by the computer system instead of the customers, thus being applicable to 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 queuing system mainly adopts a first-come first-serve or short-job first-priority mode to realize queuing.
However, the prior art has the technical problems that different services are handled, the required handling time is different, the handling time of some simple services is short, and the waiting time is long after the user queues up the sequence, so that the user experience is not good.
Disclosure of Invention
The embodiment of the invention provides a queuing method for reducing the waiting time of a user with long service handling time and improving the queuing experience of the user, which comprises the following steps: receiving a queuing request, wherein the queuing request comprises a service name; acquiring corresponding service handling time according to the service name; and generating a queuing sequence number according to the queuing sequence number and the service handling time, wherein the queuing sequence number is used for calling the number of the user with the service handling time preferentially.
The embodiment of the invention also provides a queuing device, which is used for reducing the waiting time of a user during service handling and improving the queuing experience of the user, and comprises the following components: the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving a queuing request which comprises a service name; the acquisition unit is used for acquiring corresponding service handling duration according to the service name; and the generating unit is used for generating a queuing sequence number according to the queuing sequence number and the service handling time, wherein the queuing sequence number is used for preferentially calling the user with the service handling time.
The embodiment of the present invention further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and capable of running on the processor, and when the processor executes the computer program, the above numbering method is implemented.
An embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the numbering method is implemented.
An embodiment of the present invention further provides a computer program product, where the computer program product includes a computer program, and when the computer program is executed by a processor, the numbering method is implemented.
In the embodiment of the invention, the queuing sequence number is generated according to the queuing sequence number and the service handling time, compared with the prior art of first-come-first-serve, the queuing sequence number is generated according to the service handling time, and the queuing sequence number is used for preferentially calling the number of the user with the long service handling time, so that the waiting time of the user with the long service handling time is reduced, and the queuing experience of the user is improved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts. In the drawings:
FIG. 1 is a flow chart of a numbering process in an embodiment of the present description;
FIG. 2 is a schematic diagram of a numbering system in an embodiment of the present disclosure;
FIG. 3 is another flow chart of a numbering process in an embodiment of the present disclosure;
FIG. 4 is a schematic view of a numbering device in an embodiment of the present description;
fig. 5 is another schematic diagram of a numbering device in the embodiment of the present description.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the embodiments of the present invention are further described in detail below with reference to the accompanying drawings. The exemplary embodiments and descriptions of the present invention are provided to explain the present invention, but not to limit the present invention.
Please refer to fig. 2. A numbering system is provided for embodiments of the present description. The system can include a terminal device, a server, and a 5G base station. The terminal equipment can interact with the server through the 5G base station so as to receive or send the 5G message. The terminal device may be various electronic devices including, but not limited to, a smart phone, a tablet computer, and the like. The server can analyze and process the received data of the terminal equipment, and feed back the processing result to the terminal equipment. The server may perform the numbering process. The numbering device may be located in the server. The numbering method provided by the embodiment of the disclosure can also be executed by a server cluster which is different from the server and can communicate with the terminal device. The corresponding numbering device may be placed in the server cluster.
Specifically, a 5G base station may be deployed near the server. The 5G base station may be overlaid to the server. After the terminal device enters the coverage of the 5G base station, the 5G base station may detect the terminal device. The 5G base station may push a 5G message to the terminal device. The 5G message may be used to select the service that needs to be handled. The terminal equipment can select transacted services through the 5G message, and generates and sends a queuing request. The server can receive a queuing request sent by the terminal equipment. The queuing request may include a service name. The server may perform the queuing method to generate a queuing sequence number. The server may feed back the queuing sequence number to the user via a 5G message. The server may also generate an expected wait time. The server may feed back the expected wait time to the user via a 5G message. The server may also feed back to the user the preparation work that needs to be done. The terminal equipment can check the queuing sequence number, the predicted waiting time and the preparation work required to be done through the 5G message.
Please refer to fig. 1. The embodiment of the specification provides a numbering method. The method specifically comprises the steps of S11, receiving a queuing request, wherein the queuing request comprises a service name;
in some embodiments, the service name may be a service identifier that needs to be numbered in each industry. The queuing request may also include a user name. A queuing request may include a user name. A queuing request may also include one or more service names.
In some embodiments, the terminal device may select the service name through a 5G message. The terminal device may generate a queuing request according to the selected service name. The terminal device may send the queuing request. The server may receive a queuing request.
For example, the service is a banking service. Specifically, the service name may be account opening, balance inquiry, account transfer, financing, and the like. The numbering system can be a numbering system of a bank outlet. The user can select one or more service names to be handled in the smart phone in sequence and generate a queuing request. The smart phone can send the queuing request to a queuing system of a banking outlet through a 5G message.
S12, acquiring corresponding service handling duration according to the service name;
in some embodiments, the transaction duration may be the time consumed in actually transacting the business; the queuing request may include a service name. One service name may correspond to one service transaction duration. A plurality of actual transaction durations for transacting the service may be counted. The service transaction duration may be an average of actual transaction durations.
In some embodiments, a user needs to handle multiple services at once. The queuing request may include a plurality of service names. The actual transaction duration for the plurality of services may be counted. The service transaction duration may be the sum of the average values of the actual transaction durations of a plurality of services.
Step S13, generating a queuing sequence number according to the queuing sequence number and the service handling time, wherein the queuing sequence number is used for calling the number of a user with the service handling time in a priority mode;
in some embodiments, the server may receive the queuing requests of different terminal devices in chronological order. A user may correspond to a queuing sequence number. The queuing sequence number can be the number of the team when the corresponding user joins the queuing team. The queuing sequence numbers corresponding to different users can be the same or different. The queuing sequence number may be a series of consecutive integers arranged in ascending order. One user may correspond to one integer in the queued sequence numbers. Further, the smaller the queuing sequence number is, the earlier the user can be called.
For example, there are 9 users in the queue. The 10 th user now makes a ranking. The 10 th user has a queue precedence number of 10. After the queuing sequence number is generated according to the queuing sequence number and the service handling duration, the queuing sequence numbers (1, 2,3,4 \8230; 10) of 10 users are obtained. Suppose that the 10 th user corresponds to a queuing sequence number of 3. The number of people the 10 th user needs to wait for is 2.
In some embodiments, generating the queuing sequence number based on the queuing sequence number and the service transaction duration includes analyzing the duration of the service transaction duration. And generating a queuing sequence number according to the service handling duration and the corresponding queuing sequence number. The queuing sequence number is used for calling the number of the user with short service handling time in priority.
In some embodiments, referring to fig. 3, in step S13, the queuing sequence number is generated according to the queuing sequence number and the service transaction duration, including,
step S31, dividing the service into a plurality of service types according to service handling duration, wherein different service types correspond to different sequence weights and service weights;
specifically, the service type may be a category to which the service belongs. A traffic type may correspond to an order weight and a traffic weight. In order to reduce the waiting time of the user with long service handling time, the longer the service handling time is, the larger the sequence weight and the service weight corresponding to the service type are.
For example, services can be divided into class a services, class B services, and class C services according to service transaction duration. The service handling time of the class A service is shortest, the service handling time of the class B service is second, and the service handling time of the class C service is longer. The sequence weight corresponding to the class a service is 1, and the service weight is 10. The sequence weight corresponding to class B traffic is 3 and the traffic weight is 20. The order weight corresponding to the class C service is 5, and the service weight is 40.
Step S32, determining a queuing weight according to the queuing sequence number, the sequence weight corresponding to the service type and the service weight;
specifically, the queuing weight of the user with the queuing precedence order number N may be equal to the service weight + nxthe ordering weight.
For example, 10 users have been ranked previously, and the 11 th user requests to handle class B services by ranking. The queuing sequence number of the 11 th user is 11, and the queuing weight of the 11 th user is 20+11 × 3=53.
And step S33, generating a queuing sequence number according to the queuing weight.
And comparing the queuing weights of different users, wherein the smaller the queuing weight is, the smaller the generated queuing sequence number is, and the earlier the number can be called. Further, under the condition that the queuing weights of different users are the same, a queuing sequence number is generated according to the service handling duration. Specifically, the ranking weights are the same, and users with long service handling time can be ranked in front of users with long service handling time.
For example, there are 9 people in line in a team. The 10 th and 11 th users are in line in sequence. The 11 th user transacts the class B service, and the ranking weight is 53. The 10 th user handles class C service, and the queuing weight is 40+10 × 5=90. The queuing sequence number corresponding to the 11 th user is smaller than that of the 10 th user, so that the 11 th user is preferentially called.
For another example, the ranking weight of the 11 th user is 53, and the ranking weight of the 10 th user is also 53. The 11 th user transacts class B services and the 10 th user transacts class C services. The 11 th user may be ranked in front of the 10 th user.
In some embodiments, the services are divided into a plurality of service types according to the transaction duration and the preset conditions of the services. The preset condition may include a time range.
For example, the time range may include within 5 minutes, 5 minutes to 10 minutes, 10 minutes or more. The service types may be divided into class a services, class B services and class C services according to three time ranges. The service handling time corresponding to the class A service is less than 5 minutes. The service handling time of the class B service is 5 minutes to 10 minutes. The service handling time corresponding to the class C service is more than 10 minutes.
In some embodiments, the determining the queuing weight according to the queuing sequence number, the sequence weight corresponding to the service type, and the service weight further includes: and reducing the ranking weight of the users with overtime actual waiting time according to the overtime weight.
Specifically, in order to avoid the overtime waiting time of the user with long service handling time caused by the queue-jumping of the user with short service handling time, a time threshold value can be set, and when the actual waiting time of the user exceeds the time threshold value, the queuing weight of the overtime user is reduced, so that the queuing sequence number of the user moves forward. Specifically, according to the overtime weight corresponding to the service type of the user with the overtime waiting time, the ranking weight of the user with the overtime waiting time is reduced.
For example, the time threshold is 30 minutes. In the queuing sequence number, the overtime weight of the class a service is 5. The timeout weight for class B traffic is 10. The timeout weight for class C traffic is 20. Class C service is handled by the 10 th user, and the queuing weight is 40+10 × 5=90. Assume that the actual wait time for the 10 th user exceeds 30 minutes. The reduced rank weight is 40+10 × 5-20=70.
In some embodiments, determining the queuing weight according to the queuing sequence number and the sequence weight and the service weight corresponding to the service type includes: and after the number is called according to the queuing sequence number, the queuing weight of the rest queuing users is reduced according to the sequence weight.
Specifically, the former users are called continuously, and the queuing weight of the remaining queuing users is reduced according to the sequence weight for each user calling. After a user is called, the ranking weight of the nth user among the remaining users may be equal to the original ranking weight-order weight.
For example, the 54 th user handles class a service, the queuing weight is 54 × 1+10=64, the 5 th user handles class C service, the queuing weight is 5 × 5+40=65, and the 54 th user is ranked in front of the 5 th user. After one user is called, the queuing weight of the 54 th user is 54 × 1+10-1=63, the queuing weight of the 5 th user is 5 × 5+40-5=60, and the queuing weight of the 54 th user is greater than the queuing weight of the 5 th user. The 54 th user may be ranked behind the 5 th user.
In some embodiments, after the number is called according to the queuing sequence number, the queuing weight of the rest queuing users is reduced according to the sequence weight; generating a queuing sequence number according to the queuing weight; and feeding back the number of people needing waiting to the user according to the generated queuing sequence number.
In some embodiments, the ranking weight of users whose actual wait time has timed out is reduced according to the timeout weight; generating a queuing sequence number according to the queuing weight; and feeding back the number of people needing waiting to the user according to the generated queuing sequence number.
Specifically, the number of people waiting may be equal to the queuing sequence number-1.
In some embodiments, the queuing method further comprises generating an expected waiting time according to the queuing sequence number and the service transaction duration; the expected wait time is fed back to the user.
Specifically, the larger the queuing sequence number, the longer the expected latency. The server may generate the expected wait time based on the queuing sequence number and the transaction duration. The server may send the expected wait time to the terminal device via a 5G message.
According to the queuing sequence number, the number of the users with the queuing sequence number of M is M-1. Predicted waiting time W of user with queuing sequence number M N And the mark is =sigmaTi, the Ti is the user service processing time with the queuing sequence number of i, and i =1,2 \8230, M-1.
The embodiment of the invention also provides a numbering device, which is described with reference to fig. 4. The device comprises: a receiving unit 41, configured to receive a queuing request, where the queuing request includes a service name;
an obtaining unit 42, configured to obtain a corresponding service transaction duration according to the service name;
a generating unit 43, configured to generate a queuing sequence number according to the queuing sequence number and the service transaction duration, where the queuing sequence number is used to preferentially call a number of a user with the service transaction duration.
Further, please refer to fig. 5. The queuing device further comprises a second generating unit 51, configured to generate a predicted waiting time according to the queuing sequence number and the service handling duration;
a feedback unit 52 for feeding back the expected waiting time and the number of people waiting to the user.
Because the principle of solving the problems of the device is similar to that of the numbering method, the implementation of the device can refer to the implementation of the numbering method, and repeated parts are not described again.
The embodiment of the present invention further provides a computer device, which includes a memory, a processor, and a computer program stored in the memory and capable of running on the processor, and when the processor executes the computer program, the above numbering method is implemented.
An embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored, and when the computer program is executed by a processor, the above-mentioned numbering method is implemented.
An embodiment of the present invention further provides a computer program product, where the computer program product includes a computer program, and when the computer program is executed by a processor, the numbering method is implemented.
In the embodiment of the invention, the service type of a user is determined according to the transaction duration of the service, and the user corresponds to a queuing sequence number; and generating a queuing sequence number according to the queuing sequence number corresponding to the user and the service type of the user.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above-mentioned embodiments are provided to further explain the objects, technical solutions and advantages of the present invention in detail, and it should be understood that the above-mentioned embodiments are only examples of the present invention and should not be used to limit the scope of the present invention, and any modifications, equivalents, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.
Claims (10)
1. A numbering process, comprising:
receiving a queuing request, wherein the queuing request comprises a service name;
acquiring corresponding service handling time according to the service name;
and generating a queuing sequence number according to the queuing sequence number and the service handling time, wherein the queuing sequence number is used for calling the number of the user with the service handling time preferentially.
2. The method of claim 1, wherein generating a queuing sequence number based on the queuing sequence number and the service transaction duration comprises,
dividing the service into a plurality of service types according to service handling duration, wherein different service types correspond to different sequence weights and service weights;
determining a queuing weight according to the queuing sequence number, the sequence weight corresponding to the service type and the service weight, wherein the queuing weight is equal to the service weight plus the queuing sequence number multiplied by the sequence weight;
and generating a queuing sequence number according to the queuing weight.
3. The method of claim 2, wherein different service types further correspond to different overtime weights, and determining the queuing weight according to the queuing sequence number and the sequence weight and the service weight corresponding to the service type comprises:
and reducing the ranking weight of the users with overtime actual waiting time according to the overtime weight.
4. The method of claim 2, wherein determining the queuing weight based on the queuing sequence number and the sequence weight and the service weight corresponding to the service type comprises:
and after the number is called according to the queuing sequence number, the queuing weight of the rest queuing users is reduced according to the sequence weight.
5. The method of claim 1, further comprising,
and generating the expected waiting time according to the queuing sequence number and the service handling time.
6. A queuing device is characterized by comprising,
the system comprises a receiving unit, a processing unit and a processing unit, wherein the receiving unit is used for receiving a queuing request which comprises a service name;
the acquisition unit is used for acquiring corresponding service handling time according to the service name;
and the generating unit is used for generating a queuing sequence number according to the queuing sequence number and the service handling time, wherein the queuing sequence number is used for preferentially calling the user with the service handling time.
7. The apparatus of claim 6, further comprising,
and the second generation unit is used for generating the predicted waiting time according to the queuing sequence number and the service handling time.
8. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 5 when executing the computer program.
9. A computer-readable storage medium, characterized in that it stores a computer program which, when executed by a processor, implements the method of any one of claims 1 to 5.
10. A computer program product, characterized in that the computer program product comprises a computer program which, when being executed by a processor, carries out the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210531089.9A CN115619114A (en) | 2022-05-16 | 2022-05-16 | Numbering method, numbering device, electronic equipment and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210531089.9A CN115619114A (en) | 2022-05-16 | 2022-05-16 | Numbering method, numbering device, electronic equipment and computer readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115619114A true CN115619114A (en) | 2023-01-17 |
Family
ID=84856593
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210531089.9A Pending CN115619114A (en) | 2022-05-16 | 2022-05-16 | Numbering method, numbering device, electronic equipment and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115619114A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117857640A (en) * | 2024-03-07 | 2024-04-09 | 苏州工业园区一站式服务中心 | Queuing request processing method, queuing request processing device, storage medium and program product |
-
2022
- 2022-05-16 CN CN202210531089.9A patent/CN115619114A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117857640A (en) * | 2024-03-07 | 2024-04-09 | 苏州工业园区一站式服务中心 | Queuing request processing method, queuing request processing device, storage medium and program product |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110276182B (en) | API distributed current limiting realization method | |
| US8701117B2 (en) | Resource consumption template processing model | |
| US8386512B2 (en) | System for managing data collection processes | |
| CN109783227B (en) | Task allocation method, device and system and computer readable storage medium | |
| CN107590002A (en) | Method for allocating tasks, device, storage medium, equipment and distributed task scheduling system | |
| CN109104336A (en) | Service request processing method, device, computer equipment and storage medium | |
| CN107819797B (en) | Access request processing method and device | |
| CN102801737A (en) | Asynchronous network communication method and device | |
| CN108881651B (en) | Data processing method, device and equipment of call platform and storage medium | |
| CN111967785A (en) | Optimization processing method and device for business handling of bank outlets | |
| CN102904824A (en) | Service providing entity selection method and device | |
| WO2016119389A1 (en) | Management method, device and system for system docking | |
| CN115619114A (en) | Numbering method, numbering device, electronic equipment and computer readable storage medium | |
| WO2016149945A1 (en) | Life cycle event processing method and vnfm | |
| CN110572524A (en) | User call processing method, device, storage medium and server | |
| US7860232B2 (en) | Method and system for migrating a telephone service from a first local exchange carrier to a second local exchange carrier | |
| CN101320443A (en) | Electronic work order processing method and device | |
| CN104243587A (en) | Load balancing method and system for message servers | |
| CN110134547B (en) | Middleware-based repeated data deleting method and related device | |
| CN108683608B (en) | Method and device for distributing flow | |
| CN112559179A (en) | Job processing method and device | |
| CN113163061A (en) | Method and device for distributing customer service terminals | |
| CN113766437B (en) | Short message sending method and device | |
| CN112667627B (en) | Data processing method and device | |
| CN106874122A (en) | Event dispatcher method and system based on message queue |
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 |