Outbound task scheduling method, device, equipment, medium and product
By dispersing data and predicting concurrency volume for outbound call task types, combining the outbound call line status, reasonably allocating outbound call tasks, solving the problem of inefficiency of outbound call tasks in high concurrency and large traffic scenarios, improving response speed and utilization Rate.
Patent Information
- Application Number
- CN202410917602.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-09
- Publication Date
- 2024-11-12
AI Technical Summary
In the scenario of outbound call requests with high concurrent and high traffic, outbound call tasks are prone to scheduling backlog and low response efficiency, resulting in inefficient execution of outbound call tasks.
By breaking up the data according to the type of outgoing call tasks to be dispatched, and using prediction algorithms to predict the concurrency amount, determining the actual concurrency amount based on the status attribute data of the current outgoing call line, and then reasonably allocating outgoing call tasks to the appropriate outgoing call line for processing .
It improves the response speed of outbound call tasks and the utilization rate of outbound call lines, improves the flexibility and reliability of outbound call tasks execution, and solves the problem of inefficient outbound call efficiency.
Smart Images

Figure CN118945271A_ABST
Abstract
Description
Background Art
[0002] At present, the outbound calling system, also known as the telemarketing system, is the main cash cow product among current communication products. Human agents actively make outbound calls, reaching customers with low cost and high accuracy.
[0003] In the related art, before the outbound call starts, an outbound call task is created through the operation background, which specifically includes information such as the outbound call list, outbound call method, contracted skill group, line configuration, etc., but is not limited thereto. Furthermore, the network outbound call is realized by randomly distributing the outbound call task to the outbound call seat.
[0004] However, under high-concurrency and high-volume outbound call requests, outbound call tasks are prone to scheduling backlogs or long idle time of outbound call seats, which in turn leads to problems such as low execution efficiency and low response efficiency of outbound call tasks.
[0005] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present disclosure, and therefore may include information that does not constitute the prior art known to ordinary technicians in the field. Summary of the invention
[0006] The purpose of the present disclosure is to provide an outbound call task scheduling method, device, equipment, medium and product, which are used to overcome the problems of low outbound call efficiency caused by the limitations and defects of related technologies at least to a certain extent.
[0007] According to the first aspect of the embodiment of the present disclosure, there is provided an outbound call task scheduling method, comprising: breaking up the data of the outbound call task according to the task type of the outbound call task to be scheduled, and pulling the broken up outbound call task to a local queue to be scheduled according to the identity identifier of the outbound call task in a list of a specified cluster; predicting the concurrency of the outbound call task corresponding to each of the task types through a prediction algorithm, recorded as the predicted concurrency; determining the actual concurrency of the outbound call task according to the state attribute data of the current outbound call line and the predicted concurrency; and allocating the outbound call task to the current outbound call line for outbound call processing according to the actual concurrency.
[0008] In an exemplary embodiment of the present disclosure, before breaking up the data of the outbound call task according to the task type of the outbound call task to be scheduled, the method further includes:
[0009] Determine the validity period of the heartbeat information sent by the scheduling service instance to the registration center, wherein the heartbeat information is cached in the first server;
[0010] The cluster corresponding to the heartbeat information within the validity period is determined as the designated cluster.
[0011] In an exemplary embodiment of the present disclosure, breaking up the data of the outbound call task according to the task type of the outbound call task to be scheduled, and pulling the broken up outbound call task to the local queue to be scheduled according to the identity of the outbound call task in the list of the designated cluster includes:
[0012] Pull the outbound call tasks of the specified cluster through a scheduled task, and break up the data of the outbound call tasks according to the task type;
[0013] Pushing the task classification of the scattered outbound call data to a list of the second server;
[0014] According to the identity identifier in the list of the second server, the scattered outbound call tasks are pulled into the local queue to be scheduled.
[0015] In an exemplary embodiment of the present disclosure, predicting the concurrency of the outbound call tasks corresponding to each task type by a prediction algorithm includes:
[0016] Determine parameter configuration items of the prediction algorithm, wherein the parameter configuration items include at least one of an outbound call cold start threshold, a queue abandonment rate threshold, an average idle time acceleration factor, a connection rate, and an algorithm influencing factor;
[0017] Decoupling the prediction algorithm through the parameter configuration items;
[0018] Based on the prediction algorithm after the decoupling configuration, the concurrency of the outbound call tasks corresponding to each of the task types is predicted.
[0019] In an exemplary embodiment of the present disclosure, predicting the concurrency of the outbound call tasks corresponding to each task type by a prediction algorithm includes:
[0020] Determine the idle seat quantity and the post-call seat quantity according to the seat status of the outbound call line;
[0021] Determine the scheduling interval time and the average connection rate according to the outbound call record of the outbound call line;
[0022] The state attribute data of the current outbound call line determines the current task concurrency and the current outbound call volume;
[0023] The prediction algorithm is used to calculate the idle seat quantity, the post-call seat quantity, the scheduling interval time, the average connection rate, the current task concurrency, the current outbound call quantity and the preset speed adjustment factor to determine the concurrency of the outbound call task.
[0024] In an exemplary embodiment of the present disclosure, the calculation formula of the prediction algorithm includes:
[0025] The predicted outbound call volume = (number of idle seats + number of seats after calls × (scheduling interval time / average connection rate) - (current task concurrency - current outbound call volume)) × speed adjustment factor.
[0026] In an exemplary embodiment of the present disclosure, predicting the concurrency of the outbound call tasks corresponding to each task type by a prediction algorithm includes:
[0027] If it is determined that the task type is a multi-agent call type, then determining the agent attribute information corresponding to the multi-agent call type, the agent attribute information including at least one of the current number of logged-in agents, the number of idle agents, the number of outbound call agents, and the connection rate;
[0028] The concurrency of the outbound call task is predicted according to the agent attribute information corresponding to the multi-agent call type.
[0029] In an exemplary embodiment of the present disclosure, predicting the concurrency of the outbound call tasks corresponding to each of the task types through a prediction algorithm further includes:
[0030] If it is determined that the task type is a single-agent call type, determining agent attribute information corresponding to the single-agent call type, the agent attribute information including at least one of a single-agent connection rate, a call-after time, and an agent status;
[0031] The concurrency of the outbound call task is predicted according to the agent attribute information corresponding to the single agent call type.
[0032] In an exemplary embodiment of the present disclosure, predicting the concurrency of the outbound call tasks corresponding to each of the task types through a prediction algorithm further includes:
[0033] If it is determined that the task type is a robot agent call type, then determining the agent attribute information corresponding to the robot agent call type, the agent attribute information including at least one of the current robot outbound call volume, the current logged-in agent volume, the idle agent volume, the outbound call agent volume, and the connection rate;
[0034] The concurrency of the outbound call task is predicted according to the agent attribute information corresponding to the robot agent call type.
[0035] In an exemplary embodiment of the present disclosure, determining the actual concurrency of the outbound call task according to the state attribute data of the current outbound call line and the predicted concurrency includes:
[0036] Analyze the status attribute data of the current outbound call line to determine the current outbound call line concurrency, concurrency per second, current ringing outbound call volume and current conversation outbound call volume;
[0037] The predicted concurrency, the current outbound call line concurrency, the concurrency per second, the current ringing outbound call volume and the current call outbound call volume are substituted into the actual concurrency algorithm to determine the actual concurrency of the outbound call task according to the calculation result of the actual concurrency algorithm.
[0038] In an exemplary embodiment of the present disclosure, the calculation formula of the actual concurrency algorithm includes:
[0039] The actual concurrency = Math.min (the predicted concurrency, the concurrency per second, Math.max (the current outbound call line concurrency - the current outbound call volume - the current call volume, 0)).
[0040] According to a second aspect of an embodiment of the present disclosure, there is provided an outbound call task scheduling device, including:
[0041] A pulling module, configured to break up the data of the outbound call task according to the task type of the outbound call task to be scheduled, and pull the broken outbound call task to a local queue to be scheduled according to the identity of the outbound call task in the list of the designated cluster;
[0042] A prediction module, configured to predict the concurrent volume of the outbound call tasks corresponding to each of the task types through a prediction algorithm, recorded as the predicted concurrent volume;
[0043] A determination module, configured to determine the actual concurrency of the outbound call task according to the state attribute data of the current outbound call line and the predicted concurrency;
[0044] The scheduling module is configured to allocate the outbound call task to the current outbound call line for outbound call processing according to the actual concurrent volume.
[0045] According to a third aspect of the present disclosure, there is provided an electronic device, comprising: a memory; and a processor coupled to the memory, wherein the processor is configured to execute any one of the methods described above based on instructions stored in the memory.
[0046] According to a fourth aspect of the present disclosure, a computer-readable storage medium is provided, on which a program is stored, and when the program is executed by a processor, the outbound call task scheduling method as described in any one of the above items is implemented.
[0047] According to a fifth aspect of the present disclosure, a computer program product is provided, including a computer program, characterized in that when the computer program is executed by a processor, the outbound call task scheduling method as described in any one of the above items is implemented.
[0048] The disclosed embodiment improves the accuracy of the predicted concurrency by breaking up the data of the outbound call tasks according to the task types of the outbound call tasks to be scheduled, and pulling the broken up outbound call tasks to the local queue to be scheduled according to the identity identifiers of the outbound call tasks in the list of the specified cluster, and then predicting the concurrency of the outbound call tasks corresponding to each task type through the prediction algorithm. Furthermore, the actual concurrency of the outbound call tasks is determined through the state attribute data of the current outbound call line and the predicted concurrency, and the outbound call tasks are allocated to the current outbound call line for outbound call processing according to the actual concurrency. In high-concurrency and high-traffic scenarios, the response speed of the outbound call tasks and the utilization rate of the outbound call lines are improved, and the calculation scheme for predicting the concurrency is refined, thereby improving the flexibility and reliability of the execution of the outbound call tasks.
[0049] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS
[0050] The accompanying drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the specification are used to explain the principles of the present disclosure. Obviously, the accompanying drawings described below are only some embodiments of the present disclosure, and for ordinary technicians in this field, other accompanying drawings can be obtained based on these accompanying drawings without creative work.
[0051] Figure 1 A schematic diagram showing an exemplary system architecture to which the outbound call task scheduling solution according to an embodiment of the present invention can be applied;
[0052] Figure 2 is a flow chart of an outbound call task scheduling method in an exemplary embodiment of the present disclosure;
[0053] Figure 3 is a flow chart of another outbound call task scheduling method in an exemplary embodiment of the present disclosure;
[0054] Figure 4 is a flow chart of another outbound call task scheduling method in an exemplary embodiment of the present disclosure;
[0055] Figure 5 is a flow chart of another outbound call task scheduling method in an exemplary embodiment of the present disclosure;
[0056] Figure 6 is a flow chart of another outbound call task scheduling method in an exemplary embodiment of the present disclosure;
[0057] Figure 7 is a flow chart of another outbound call task scheduling method in an exemplary embodiment of the present disclosure;
[0058] Figure 8is a flow chart of another outbound call task scheduling method in an exemplary embodiment of the present disclosure;
[0059] Fig. 9 is a flow chart of another outbound call task scheduling method in an exemplary embodiment of the present disclosure;
[0060] Fig.10 It is a schematic diagram of an outbound call task scheduling solution in the prior art;
[0061] Fig.11 It is a schematic diagram of another outbound call task scheduling solution in the prior art;
[0062] Fig.12 It is a schematic diagram of another outbound call task scheduling solution in the prior art;
[0063] Fig.13 is a schematic diagram of an outbound call task scheduling solution in an exemplary embodiment of the present disclosure;
[0064] Fig.14 is a schematic diagram of another outbound call task scheduling solution in an exemplary embodiment of the present disclosure;
[0065] Fig.15 is a schematic diagram of another outbound call task scheduling solution in an exemplary embodiment of the present disclosure;
[0066] Fig.16 is a schematic diagram of another outbound call task scheduling solution in an exemplary embodiment of the present disclosure;
[0067] Fig.17 is a schematic diagram of another outbound call task scheduling solution in an exemplary embodiment of the present disclosure;
[0068] Fig.18 is a schematic diagram of another outbound call task scheduling solution in an exemplary embodiment of the present disclosure;
[0069] Fig.19 is a block diagram of an outbound call task scheduling device in an exemplary embodiment of the present disclosure;
[0070] Fig. 20 is a block diagram of an electronic device in an exemplary embodiment of the present disclosure. DETAILED DESCRIPTION
[0071] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as being limited to the examples set forth herein; on the contrary, these embodiments are provided so that the present disclosure will be more comprehensive and complete, and the concepts of the example embodiments are fully conveyed to those skilled in the art. The described features, structures, or characteristics may be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present disclosure. However, those skilled in the art will appreciate that the technical solutions of the present disclosure may be practiced while omitting one or more of the specific details, or other methods, components, devices, steps, etc. may be adopted. In other cases, known technical solutions are not shown or described in detail to avoid obscuring various aspects of the present disclosure.
[0072] In addition, the accompanying drawings are only schematic diagrams of the present disclosure, and the same reference numerals in the drawings represent the same or similar parts, so their repeated description will be omitted. Some of the block diagrams shown in the accompanying drawings are functional entities, which do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and / or processor devices and / or microcontroller devices.
[0073] Figure 1 A schematic diagram showing an exemplary system architecture to which the outbound call task scheduling solution according to an embodiment of the present invention can be applied.
[0074] like Figure 1 As shown, the system architecture 100 may include one or more of terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 is used to provide a medium for communication links between the terminal devices 101, 102, 103 and the server 105. The network 104 may include various connection types, such as wired, wireless communication links, or optical fiber cables, etc.
[0075] It should be understood that Figure 1 The number of terminal devices, networks and servers in the embodiment is only for illustration. According to the implementation requirements, there may be any number of terminal devices, networks and servers. For example, the server 105 may be a server cluster composed of multiple servers.
[0076] Users can use terminal devices 101, 102, 103 to interact with server 105 through network 104 to receive or send messages, etc. Terminal devices 101, 102, 103 can be various electronic devices with display screens, including but not limited to smart phones, tablet computers, portable computers, desktop computers, etc.
[0077] In some embodiments, the outbound call task scheduling method provided in the embodiments of the present invention is generally executed by the server 105. Accordingly, the outbound call task scheduling device is generally set in the terminal device 103 (or the terminal device 101 or 102). In other embodiments, some terminals may have functions similar to those of the server device to execute the method.
[0078] The exemplary embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.
[0079] Figure 2 It is a flow chart of an outbound call task scheduling method in an exemplary embodiment of the present disclosure.
[0080] refer to Figure 2 , the outbound call task scheduling method may include:
[0081] Step S202, breaking up the data of the outbound call task according to the task type of the outbound call task to be scheduled, and pulling the broken outbound call task to the local queue to be scheduled according to the identity of the outbound call task in the list of the designated cluster.
[0082] In an exemplary embodiment of the present disclosure, by breaking up the data of the outbound call task and pulling the broken up outbound call task into a local queue to be scheduled based on the identity of the outbound call task in a list of a specified cluster, local sharding of the cluster (serve) is achieved, thereby improving the reliability and accuracy of outbound call task scheduling.
[0083] Step S204, predicting the concurrent volume of the outbound call tasks corresponding to each of the task types through a prediction algorithm, which is recorded as the predicted concurrent volume.
[0084] In an exemplary embodiment of the present disclosure, a prediction algorithm is used to predict the concurrency of the outbound call tasks corresponding to each task type, thereby achieving classified prediction of the concurrency of the outbound call tasks, making the prediction result of the concurrency more accurate.
[0085] Step S206, determining the actual concurrency of the outbound call task according to the state attribute data of the current outbound call line and the predicted concurrency.
[0086] In an exemplary embodiment of the present disclosure, the actual concurrency of the outbound call task is determined based on the status attribute data of the current outbound call line and the predicted concurrency, and the available outbound call concurrency is calculated in real time during the scheduling process, thereby improving the real-time performance of the outbound call task scheduling and the resource utilization rate of the outbound call line.
[0087] Step S208: allocating the outbound call task to the current outbound call line for outbound call processing according to the actual concurrent volume.
[0088] The disclosed embodiment breaks up the data of the outbound call tasks according to the task types of the outbound call tasks to be scheduled, and pulls the broken up outbound call tasks to the local queue to be scheduled according to the identity identifiers of the outbound call tasks in the list of a specified cluster, and then predicts the concurrency of the outbound call tasks corresponding to each task type through a prediction algorithm, thereby improving the accuracy of the predicted concurrency.
[0089] Furthermore, the actual concurrency of the outbound call task is determined through the status attribute data of the current outbound call line and the predicted concurrency, and the outbound call task is allocated to the current outbound call line for outbound call processing according to the actual concurrency. In high-concurrency and high-traffic scenarios, the response speed of the outbound call task and the utilization rate of the outbound call line are improved, and the calculation scheme of the predicted concurrency is refined, thereby improving the flexibility and reliability of the outbound call task execution.
[0090] Next, each step of the outbound call task scheduling method is described in detail.
[0091] In an exemplary embodiment of the present disclosure, Figure 3 As shown, before breaking up the data of the outbound call task according to the task type of the outbound call task to be scheduled, it also includes:
[0092] Step S302: determining the validity period of the heartbeat information sent by the scheduling service instance to the registration center, wherein the heartbeat information is cached in the first server.
[0093] In an exemplary embodiment of the present disclosure, the first server is a redis server.
[0094] Step S304: determine the cluster corresponding to the heartbeat information within the validity period as the designated cluster.
[0095] In an exemplary embodiment of the present disclosure, if the heartbeat information is "xx" seconds, the heartbeat information is valid within "xx" seconds, the corresponding cluster belongs to the specified cluster, and the specified cluster can also be recorded as an active cluster.
[0096] In an exemplary embodiment of the present disclosure, Figure 4 As shown, the data of the outbound call task to be scheduled is scattered according to the task type of the outbound call task to be scheduled, and the scattered outbound call task is pulled to the local queue to be scheduled according to the identity of the outbound call task in the list of the specified cluster, including:
[0097] Step S402: Pull the outbound call tasks of the specified cluster through a scheduled task, and break up the data of the outbound call tasks according to the task type.
[0098] Step S404: Push the task classification of the scattered outbound call data to a list of the second server.
[0099] In an exemplary embodiment of the present disclosure, the second server is a redis server.
[0100] Step S406: According to the identity identifier in the list of the second server, the scattered outbound call tasks are pulled into the local queue to be dispatched.
[0101] In an exemplary embodiment of the present disclosure, the list of the second server maintains the identity of the outbound call task, and the outbound call data is pulled and scheduled based on the identity.
[0102] In an exemplary embodiment of the present disclosure, the first server and the second server may be the same server or two independent servers.
[0103] In an exemplary embodiment of the present disclosure, Figure 5 As shown, predicting the concurrency of the outbound call tasks corresponding to each task type through the prediction algorithm includes:
[0104] Step S502, determining parameter configuration items of the prediction algorithm, wherein the parameter configuration items include at least one of an outbound call cold start threshold, a queue abandonment rate threshold, an average idle time acceleration factor, a connection rate, and an algorithm influencing factor.
[0105] Step S504: Decoupling configuration of the prediction algorithm through the parameter configuration items.
[0106] In an exemplary embodiment of the present disclosure, the prediction algorithm can be decoupled and configured through the parameter configuration items on the tenant side, realizing dynamic loading of parameters to improve the configuration efficiency and flexibility of the prediction algorithm, thereby improving the efficiency of predicting the concurrency of outbound call tasks.
[0107] Step S506: predicting the concurrency of the outbound call tasks corresponding to each of the task types based on the prediction algorithm after the decoupling configuration.
[0108] In an exemplary embodiment of the present disclosure, predicting the concurrency of the outbound call tasks corresponding to each task type by a prediction algorithm includes:
[0109] Determine the idle seat quantity and the post-call seat quantity according to the seat status of the outbound call line;
[0110] Determine the scheduling interval time and the average connection rate according to the outbound call record of the outbound call line;
[0111] The state attribute data of the current outbound call line determines the current task concurrency and the current outbound call volume;
[0112] The prediction algorithm is used to calculate the idle seat quantity, the post-call seat quantity, the scheduling interval time, the average connection rate, the current task concurrency, the current outbound call quantity and the preset speed adjustment factor to determine the concurrency of the outbound call task.
[0113] In an exemplary embodiment of the present disclosure, the calculation formula of the prediction algorithm includes:
[0114] The predicted outbound call volume = (number of idle seats + number of seats after calls × (scheduling interval time / average connection rate) - (current task concurrency - current outbound call volume)) × speed adjustment factor.
[0115] In an exemplary embodiment of the present disclosure, Figure 6 As shown, predicting the concurrency of the outbound call tasks corresponding to each task type through the prediction algorithm includes:
[0116] Step S602: If it is determined that the task type is a multi-agent call type, then determine the agent attribute information corresponding to the multi-agent call type, wherein the agent attribute information includes at least one of the current logged-in agent quantity, idle agent quantity, outbound call agent quantity and connection rate.
[0117] Step S604: predicting the concurrent volume of the outbound call task according to the agent attribute information corresponding to the multi-agent call type.
[0118] In an exemplary embodiment of the present disclosure, Figure 7 As shown, predicting the concurrency of the outbound call tasks corresponding to each task type through a prediction algorithm also includes:
[0119] Step S702: If it is determined that the task type is a single-agent call type, agent attribute information corresponding to the single-agent call type is determined, and the agent attribute information includes at least one of a single-agent connection rate, a call-after time, and an agent status.
[0120] Step S704: predicting the concurrent volume of the outbound call task according to the agent attribute information corresponding to the single agent call type.
[0121] In an exemplary embodiment of the present disclosure, Figure 8 As shown, predicting the concurrency of the outbound call tasks corresponding to each task type through a prediction algorithm also includes:
[0122] Step S802: If it is determined that the task type is a robot agent call type, the agent attribute information corresponding to the robot agent call type is determined, and the agent attribute information includes at least one of the current robot outbound call volume, the current logged-in agent volume, the idle agent volume, the outbound call agent volume and the connection rate.
[0123] Step S804: predicting the concurrency of the outbound call task according to the agent attribute information corresponding to the robot agent call type.
[0124] In an exemplary embodiment of the present disclosure, Fig. 9 As shown, determining the actual concurrency of the outbound call task according to the state attribute data of the current outbound call line and the predicted concurrency includes:
[0125] Step S902, parse the state attribute data of the current outbound call line to determine the current outbound call line concurrency, concurrency per second, current ringing outbound call volume and current conversation outbound call volume.
[0126] Step S904, substitute the predicted concurrency, the current outbound call line concurrency, the concurrency per second, the current ringing outbound call volume and the current call outbound call volume into the actual concurrency algorithm to determine the actual concurrency of the outbound call task according to the calculation result of the actual concurrency algorithm.
[0127] In an exemplary embodiment of the present disclosure, the calculation formula of the actual concurrency algorithm includes:
[0128] The actual concurrency = Math.min (the predicted concurrency, the concurrency per second, Math.max (the current outbound call line concurrency - the current outbound call volume - the current call volume, 0)).
[0129] Combine the following Figure 10-12 The outbound call task scheduling scheme in the prior art is Figures 13 to 17 The outbound call task scheduling scheme defined in the present disclosure is specifically described.
[0130] like Fig.10 As shown, the first outbound call task scheduling solution 1000 in the prior art adopts a distributed scheduling method, which schedules tasks according to scheduling service instances (scheduling service instances are such as Fig.10 server1 and server2) shown in the figure (the allocation operation is Fig.10 Each dispatch service instance executes the outbound call task in its own queue. The outbound call task in server1 is recorded as task:n, and the outbound call task in server2 is recorded as task:n+1, where n is a natural number. The outbound call solution is implemented through the execution thread, prediction algorithm and outbound call.
[0131] However, when the distributed cluster needs to be expanded, the task allocation rules will change accordingly, resulting in repeated execution of outbound call tasks.
[0132] like Fig.11As shown, the second outbound call task scheduling solution 1100 in the prior art adopts distributed preemptive scheduling, creates a new task taskn and stores it in the redis list, and each scheduling is based on the task lock (lock), and the scheduling service instance that grabs the lock (scheduling service instance is as follows Fig.11 The server1 and server2 shown in the figure perform the scheduling of the task. The scheduling service instance that fails to grab the lock traverses the next task to lock and execute. Specifically, the outbound call solution is implemented through the execution thread, prediction algorithm and outbound call.
[0133] Although the horizontal expansion of scheduling service instances is supported in a preemptive manner, due to the short execution cycle of the prediction algorithm, some scheduling service instances may fail to be locked in one scheduling cycle, and the scheduling service instance resources cannot be effectively utilized.
[0134] like Fig.12 As shown, the third outbound call task scheduling solution 1200 in the prior art adopts the task data sharding method, first pushes the active task data to the memory list of redis, maintains the identity of the outbound call task in the list, and then pushes it to the corresponding scheduling service instance according to the task id hash or modulo (the scheduling service instance is as follows Fig.12 The local task queues of server1, server2, ..., servern) shown in Fig.12 The prediction algorithm is called to make outbound calls, and the cluster resources are maximized through data sharding.
[0135] However, in a scenario with multiple predicted outbound call tasks, some types of predicted outbound call tasks may be backlogged, and this scheduling method does not take line concurrency into consideration, which may result in the failure of scheduling outbound calls due to over-concurrency.
[0136] against Figure 10-12 There are technical problems in the outbound call task scheduling solution in the prior art, such as Figures 13 to 17 As shown, the present disclosure provides an outbound call task scheduling solution to solve the above technical problems, namely, breaking up the task queue by task type to realize local sharding of the scheduling cluster (server1, server2, ..., servern), solving the problem of real-time task scheduling, and calculating the available outbound call concurrency in real time during the scheduling process to realize efficient utilization of line resources, and supporting the decoupling configuration of the prediction algorithm while scheduling, realizing dynamic loading of parameters, and improving the efficiency of predicted outbound calls.
[0137] In an exemplary embodiment of the present disclosure, Fig.13As shown, the registration process 1300 of the outbound call task scheduling solution includes: the heartbeat information of the scheduling cluster (server1, server2, ..., servern) is stored in the registration center, and the active cluster information is maintained through the redis list hset, such as "serverlp1---30s expire", "serverlp2---30sexpire", ..., "serverlpn---30s expire".
[0138] The above registration process realizes the registration center at low cost, monitors the active scheduling cluster, realizes the imperceptible expansion of the scheduling cluster (the scheduling cluster is a collection of scheduling service instances), and breaks up the task queue by task type, realizes local sharding of the scheduling cluster (server1, server2, ..., servern), solves the problem of real-time task scheduling, calculates the available outbound call concurrency in real time during the scheduling process, realizes efficient use of line resources, and supports the decoupling configuration of the prediction algorithm while scheduling, so that the parameters can be dynamically loaded, thereby improving the efficiency of predicted outbound calls.
[0139] In an exemplary embodiment of the present disclosure, the architecture of the outbound call task scheduling solution is mainly divided into the following four modules, specifically including a cluster management module, a task management module, a prediction algorithm module and a scheduling execution module, and the working process includes the following steps:
[0140] In an exemplary embodiment of the present disclosure, in the cluster management module, each scheduling service instance (serv) sends a heartbeat to the registration center at regular intervals, and the registration center records the heartbeat to redis and records a currently active cluster hset. Each heartbeat is valid for 30 seconds.
[0141] In an exemplary embodiment of the present disclosure, Fig.14 As shown, the task management module 1400: pulls the currently active predicted outbound call tasks through scheduled tasks, breaks up the data according to the task type, and pushes it to the redis list. Each scheduling service instance pulls the corresponding task to the local queue to be executed according to its index (identity identifier) in the active cluster list.
[0142] In an exemplary embodiment of the present disclosure, Fig.15 As shown, the prediction algorithm module 1500: according to the task configuration, calls the configured prediction algorithm, loads the prediction algorithm parameters, and calculates the outbound call concurrency according to the real-time data of the agents.
[0143] In an exemplary embodiment of the present disclosure, the implementation of the multi-person prediction algorithm includes: calculating the current outbound call volume based on the current number of logged-in seats, the number of idle seats, the number of outbound call seats and the connection rate.
[0144] In an exemplary embodiment of the present disclosure, a single-person prediction algorithm calculates the outbound call volume based on the single-agent connection rate, the length of the call, and the agent status.
[0145] In an exemplary embodiment of the present disclosure, the human-machine prediction algorithm calculates the current outbound call volume based on the current robot outbound call volume, the current logged-in seat volume, the idle seat volume, the outbound call seat volume and the connection rate.
[0146] In an exemplary embodiment of the present disclosure, Fig.16 As shown, the scheduling execution module 1600: pops the outbound call task in the local queue to be executed, verifies whether the task is in the outbound call period, and verifies whether it is blacklist intercepted and frequency control intercepted, introduces the prediction algorithm parameters to obtain the scheduling concurrency, obtains the current maximum outbound call volume through the real-time outbound call volume calculation module, and obtains data outbound calls from the scattered data set.
[0147] In an exemplary embodiment of the present disclosure, Fig.17 As shown, the real-time outbound call volume calculation module 1700: when making an actual outbound call, the actual scheduling concurrency is calculated according to the current outbound call line concurrency, CTI configuration caps (concurrency per second), the current ringing outbound call volume, and the current conversation outbound call volume. The specific calculation rule is actual scheduling volume = Math.min (algorithm scheduling volume, caps, Math.max (line concurrency - current ringing - current outbound call, 0)).
[0148] For example, if the algorithm scheduling amount is 370, the actual scheduling amount is =Math.min(370, 360, Math.max(1050-250-450, 0)) = 350 concurrent, and the line resources can be fully utilized at this time.
[0149] In an exemplary embodiment of the present disclosure, a data scattering module: The data scattering module is divided into n queues according to the data batch ID, and polls and retrieves the required outbound call volume calculated in the previous step in turn.
[0150] Corresponding to the above method embodiment, the present disclosure also provides an outbound call task scheduling device, which can be used to execute the above method embodiment.
[0151] Fig.19 It is a block diagram of an outbound call task scheduling device in an exemplary embodiment of the present disclosure.
[0152] refer to Fig.19 , the outbound call task scheduling device 1900 may include:
[0153] The pulling module 1902 is configured to break up the data of the outbound call task according to the task type of the outbound call task to be scheduled, and pull the broken outbound call task to the local queue to be scheduled according to the identity of the outbound call task in the list of the designated cluster.
[0154] The prediction module 1904 is configured to predict the concurrent volume of the outbound call tasks corresponding to each of the task types through a prediction algorithm, which is recorded as the predicted concurrent volume.
[0155] The determination module 1906 is configured to determine the actual concurrency of the outbound call task according to the state attribute data of the current outbound call line and the predicted concurrency.
[0156] The scheduling module 1908 is configured to allocate the outbound call task to the current outbound call line for outbound call processing according to the actual concurrent volume.
[0157] In an exemplary embodiment of the present disclosure, the determination module 1906 is further configured to:
[0158] Determine the validity period of the heartbeat information sent by the scheduling service instance to the registration center, wherein the heartbeat information is cached in the first server;
[0159] The cluster corresponding to the heartbeat information within the validity period is determined as the designated cluster.
[0160] In an exemplary embodiment of the present disclosure, the pulling module 1902 is further configured to:
[0161] Pull the outbound call tasks of the specified cluster through a scheduled task, and break up the data of the outbound call tasks according to the task type;
[0162] Pushing the task classification of the scattered outbound call data to a list of the second server;
[0163] According to the identity identifier in the list of the second server, the scattered outbound call tasks are pulled into the local queue to be scheduled.
[0164] In an exemplary embodiment of the present disclosure, the prediction module 1904 is further configured to:
[0165] Determine parameter configuration items of the prediction algorithm, wherein the parameter configuration items include at least one of an outbound call cold start threshold, a queue abandonment rate threshold, an average idle time acceleration factor, a connection rate, and an algorithm influencing factor;
[0166] Decoupling the prediction algorithm through the parameter configuration items;
[0167] Based on the prediction algorithm after the decoupling configuration, the concurrency of the outbound call tasks corresponding to each of the task types is predicted.
[0168] In an exemplary embodiment of the present disclosure, predicting the concurrency of the outbound call tasks corresponding to each task type by a prediction algorithm includes:
[0169] wherein the idle seat quantity and the post-call seat quantity are determined according to the seat status of the outbound call line;
[0170] Determine the scheduling interval time and the average connection rate according to the outbound call record of the outbound call line;
[0171] The state attribute data of the current outbound call line determines the current task concurrency and the current outbound call volume;
[0172] The prediction algorithm is used to calculate the idle seat quantity, the post-call seat quantity, the scheduling interval time, the average connection rate, the current task concurrency, the current outbound call quantity and the preset speed adjustment factor to determine the concurrency of the outbound call task.
[0173] In an exemplary embodiment of the present disclosure, the calculation formula of the prediction algorithm includes:
[0174] The predicted outbound call volume = (number of idle seats + number of seats after calls × (scheduling interval time / average connection rate) - (current task concurrency - current outbound call volume)) × speed adjustment factor.
[0175] In an exemplary embodiment of the present disclosure, the prediction module 1904 is further configured to:
[0176] If it is determined that the task type is a multi-agent call type, then determining the agent attribute information corresponding to the multi-agent call type, the agent attribute information including at least one of the current number of logged-in agents, the number of idle agents, the number of outbound call agents, and the connection rate;
[0177] The concurrency of the outbound call task is predicted according to the agent attribute information corresponding to the multi-agent call type.
[0178] In an exemplary embodiment of the present disclosure, the prediction module 1904 is further configured to:
[0179] If it is determined that the task type is a single-agent call type, determining agent attribute information corresponding to the single-agent call type, the agent attribute information including at least one of a single-agent connection rate, a call-after time, and an agent status;
[0180] The concurrency of the outbound call task is predicted according to the agent attribute information corresponding to the single agent call type.
[0181] In an exemplary embodiment of the present disclosure, the prediction module 1904 is further configured to:
[0182] If it is determined that the task type is a robot agent call type, then determining the agent attribute information corresponding to the robot agent call type, the agent attribute information including at least one of the current robot outbound call volume, the current logged-in agent volume, the idle agent volume, the outbound call agent volume, and the connection rate;
[0183] The concurrency of the outbound call task is predicted according to the agent attribute information corresponding to the robot agent call type.
[0184] In an exemplary embodiment of the present disclosure, the determination module 1906 is further configured to:
[0185] Analyze the status attribute data of the current outbound call line to determine the current outbound call line concurrency, concurrency per second, current ringing outbound call volume and current conversation outbound call volume;
[0186] The predicted concurrency, the current outbound call line concurrency, the concurrency per second, the current ringing outbound call volume and the current call outbound call volume are substituted into the actual concurrency algorithm to determine the actual concurrency of the outbound call task according to the calculation result of the actual concurrency algorithm.
[0187] In an exemplary embodiment of the present disclosure, the calculation formula of the actual concurrency algorithm includes:
[0188] The actual concurrency = Math.min (the predicted concurrency, the concurrency per second, Math.max (the current outbound call line concurrency - the current outbound call volume - the current call volume, 0)).
[0189] Since the functions of the device 1900 have been described in detail in the corresponding method embodiments, the present disclosure will not elaborate on them here.
[0190] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.
[0191] In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.
[0192] It will be appreciated by those skilled in the art that various aspects of the present invention may be implemented as a system, method or program product. Therefore, various aspects of the present invention may be specifically implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software, which may be collectively referred to herein as a "circuit", "module" or "system".
[0193] Refer to the following Fig. 20 The electronic device 2000 according to this embodiment of the present invention will be described. Fig. 20 The electronic device 2000 shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.
[0194] like Fig. 20 As shown, the electronic device 2000 is in the form of a general computing device. The components of the electronic device 2000 may include but are not limited to: the at least one processing unit 2010, the at least one storage unit 2020, and a bus 2030 connecting different system components (including the storage unit 2020 and the processing unit 2010).
[0195] The storage unit stores program codes, which can be executed by the processing unit 2010, so that the processing unit 2010 performs the steps according to various exemplary embodiments of the present invention described in the above “Exemplary Method” section of this specification. For example, the processing unit 2010 can perform the method shown in the embodiment of the present disclosure.
[0196] The storage unit 2020 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 20201 and / or a cache storage unit 20202 , and may further include a read-only storage unit (ROM) 20203 .
[0197] The storage unit 2020 may also include a program / utility 20204 having a set (at least one) of program modules 20205, such program modules 20205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include the implementation of a network environment.
[0198] Bus 2030 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
[0199] The electronic device 2000 may also communicate with one or more external devices 2040 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may also communicate with one or more devices that enable a user to interact with the electronic device 2000, and / or communicate with any device that enables the electronic device 2000 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed through an input / output (I / O) interface 2050. In addition, the electronic device 2000 may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) through a network adapter 2060. As shown, the network adapter 2060 communicates with other modules of the electronic device 2000 through a bus 2030. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the electronic device 2000, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, etc.
[0200] Through the description of the above implementation, it is easy for those skilled in the art to understand that the example implementation described here can be implemented by software, or by software combined with necessary hardware. Therefore, the technical solution according to the implementation of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, including several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation of the present disclosure.
[0201] In an exemplary embodiment of the present disclosure, a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of the present specification is stored. In some possible implementations, various aspects of the present invention can also be implemented in the form of a program product, which includes a program code, and when the program product is run on a terminal device, the program code is used to enable the terminal device to execute the steps according to various exemplary embodiments of the present invention described in the above "Exemplary Method" section of the present specification.
[0202] The program product for implementing the above method according to an embodiment of the present invention can adopt a portable compact disk read-only memory (CD-ROM) and include program code, and can be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited thereto, and in this document, a readable storage medium can be any tangible medium containing or storing a program, which can be used by or in combination with an instruction execution system, an apparatus or a device.
[0203] Among them, the readable medium can be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of readable storage media (a non-exhaustive list) include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.
[0204] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.
[0205] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.
[0206] In an exemplary embodiment of the present disclosure, a computer program product is also provided, which can be loaded or stored in any combination of one or more readable media, and can be written in any combination of one or more programming languages to perform the program code of the present invention, including object-oriented programming languages such as Java, C++, etc., and also conventional procedural programming languages such as "C" language or similar programming languages. The program code can be executed entirely on the user computing device, partially on the user device, as an independent software package, partially on the user computing device and partially on a remote computing device, or completely on a remote computing device or server. In the case of a remote computing device, the remote computing device can be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computing device (for example, using an Internet service provider to connect through the Internet).
[0207] In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to an exemplary embodiment of the present invention, and are not intended to be limiting. It is easy to understand that the processes shown in the above-mentioned figures do not indicate or limit the time sequence of these processes. In addition, it is also easy to understand that these processes can be performed synchronously or asynchronously, for example, in multiple modules.
[0208] Those skilled in the art will readily appreciate other embodiments of the present disclosure after considering the specification and practicing the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the present disclosure that follow the general principles of the present disclosure and include common knowledge or customary techniques in the art that are not disclosed in the present disclosure. The specification and examples are to be considered exemplary only, and the true scope and concept of the present disclosure are indicated by the claims.
Claims
1. A method for scheduling outbound call tasks, characterized in that: include: Scattering the data of the outbound call task according to the task type of the outbound call task to be scheduled, and pulling the scattered outbound call task to the local queue to be scheduled according to the identity of the outbound call task in the list of the designated cluster; Predicting the concurrent volume of the outbound call tasks corresponding to each of the task types by a prediction algorithm, recorded as the predicted concurrent volume; Determine the actual concurrency of the outbound call task according to the state attribute data of the current outbound call line and the predicted concurrency; The outbound call task is allocated to the current outbound call line for outbound call processing according to the actual concurrent volume.
2. The outbound call task scheduling method according to claim 1, characterized in that: Before breaking up the data of the outbound call task according to the task type of the outbound call task to be scheduled, the method further includes: Determine the validity period of the heartbeat information sent by the scheduling service instance to the registration center, wherein the heartbeat information is cached in the first server; The cluster corresponding to the heartbeat information within the validity period is determined as the designated cluster.
3. The outbound call task scheduling method according to claim 1, characterized in that: Scattering the data of the outbound call task according to the task type of the outbound call task to be scheduled, and pulling the scattered outbound call task to the local queue to be scheduled according to the identity of the outbound call task in the list of the designated cluster, including: Pull the outbound call tasks of the specified cluster through a scheduled task, and break up the data of the outbound call tasks according to the task type; Pushing the task classification of the scattered outbound call data to a list of the second server; According to the identity identifier in the list of the second server, the scattered outbound call tasks are pulled into the local queue to be scheduled.
4. The outbound call task scheduling method according to claim 1, characterized in that: Predicting the concurrency of the outbound call tasks corresponding to each task type by a prediction algorithm includes: Determine parameter configuration items of the prediction algorithm, wherein the parameter configuration items include at least one of an outbound call cold start threshold, a queue abandonment rate threshold, an average idle time acceleration factor, a connection rate, and an algorithm influencing factor; Decoupling the prediction algorithm through the parameter configuration items; Based on the prediction algorithm after the decoupling configuration, the concurrency of the outbound call tasks corresponding to each of the task types is predicted.
5. The outbound call task scheduling method according to claim 1, characterized in that: Predicting the concurrency of the outbound call tasks corresponding to each task type by a prediction algorithm includes: Determine the idle seat quantity and the post-call seat quantity according to the seat status of the outbound call line; Determine the scheduling interval time and the average connection rate according to the outbound call record of the outbound call line; The state attribute data of the current outbound call line determines the current task concurrency and the current outbound call volume; The prediction algorithm is used to calculate the idle seat quantity, the post-call seat quantity, the scheduling interval time, the average connection rate, the current task concurrency, the current outbound call quantity and the preset speed adjustment factor to determine the concurrency of the outbound call task.
6. The outbound call task scheduling method according to claim 1, characterized in that: Predicting the concurrency of the outbound call tasks corresponding to each task type by a prediction algorithm includes: If it is determined that the task type is a multi-agent call type, then determining the agent attribute information corresponding to the multi-agent call type, the agent attribute information including at least one of the current number of logged-in agents, the number of idle agents, the number of outbound call agents, and the connection rate; The concurrency of the outbound call task is predicted according to the agent attribute information corresponding to the multi-agent call type.
7. The outbound call task scheduling method according to claim 1, characterized in that: Predicting the concurrency of the outbound call tasks corresponding to each task type by a prediction algorithm also includes: If it is determined that the task type is a single-agent call type, determining agent attribute information corresponding to the single-agent call type, the agent attribute information including at least one of a single-agent connection rate, a call-after time, and an agent status; The concurrency of the outbound call task is predicted according to the agent attribute information corresponding to the single agent call type.
8. The outbound call task scheduling method according to claim 1, characterized in that: Predicting the concurrency of the outbound call tasks corresponding to each task type by a prediction algorithm also includes: If it is determined that the task type is a robot agent call type, then determining the agent attribute information corresponding to the robot agent call type, the agent attribute information including at least one of the current robot outbound call volume, the current logged-in agent volume, the idle agent volume, the outbound call agent volume, and the connection rate; The concurrency of the outbound call task is predicted according to the agent attribute information corresponding to the robot agent call type.
9. The outbound call task scheduling method according to claim 1, characterized in that: Determining the actual concurrency of the outbound call task according to the state attribute data of the current outbound call line and the predicted concurrency includes: Analyze the status attribute data of the current outbound call line to determine the current outbound call line concurrency, concurrency per second, current ringing outbound call volume and current conversation outbound call volume; The predicted concurrency, the current outbound call line concurrency, the concurrency per second, the current ringing outbound call volume and the current call outbound call volume are substituted into the actual concurrency algorithm to determine the actual concurrency of the outbound call task according to the calculation result of the actual concurrency algorithm.
10. An outbound call task scheduling device, characterized in that: include: A pulling module, configured to break up the data of the outbound call task according to the task type of the outbound call task to be scheduled, and pull the broken outbound call task to a local queue to be scheduled according to the identity of the outbound call task in the list of the designated cluster; A prediction module, configured to predict the concurrent volume of the outbound call tasks corresponding to each of the task types through a prediction algorithm, recorded as the predicted concurrent volume; A determination module, configured to determine the actual concurrency of the outbound call task according to the state attribute data of the current outbound call line and the predicted concurrency; The scheduling module is configured to allocate the outbound call task to the current outbound call line for outbound call processing according to the actual concurrent volume.
11. An electronic device, characterized in that: include: Memory; as well as A processor coupled to the memory, the processor being configured to execute the outbound call task scheduling method according to any one of claims 1 to 9 based on instructions stored in the memory.
12. A computer-readable storage medium having a program stored thereon, wherein when the program is executed by a processor, the outbound call task scheduling method according to any one of claims 1 to 9 is implemented.
13. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the outbound call task scheduling method as described in any one of claims 1 to 9 is implemented.
Citation Information
Patent Citations
Task scheduling method and device, computer equipment and storage medium
CN113220427A
Predictive outbound method and predictive outbound system
CN113329132A
Task processing method, device, equipment and storage medium
CN114090205A
Predictive call-out system and method based on mobile terminal, and storage medium
CN115941845A
Incoming and outgoing call system and scheduling method for incoming and outgoing call system
CN117201677A
