Outbound call task scheduling method, electronic device, storage medium and program product

Abstract

The present disclosure provides a method for scheduling outbound call tasks, comprising: synchronizing the outbound call task to any task queue that does not contain the outbound call task based on a determination that the outbound call task meets outbound call conditions, thereby increasing the number of queues to which the outbound call task belongs, wherein the outbound call conditions include the presence of waiting leads and idle outbound call resources; retrieving a target task from each outbound call task in all task queues based on a task extraction rule, wherein the probability of retrieving the target task is proportional to the number of queues to which it belongs; and updating the queue to which the target task belongs based on an analysis of the outbound call parameters of the target task, thereby adjusting the probability of retrieving the target task. The present disclosure also provides an electronic device, a storage medium, and a computer program product.

Description

Technical Field

[0001] The present disclosure relates to the field of resource utilization, and in particular to a method for scheduling outbound call tasks, electronic equipment, storage medium, and computer program product. Background Art

[0002] Intelligent outbound call robots, based on artificial intelligence, possess capabilities such as speech recognition, semantic understanding, and speech synthesis. They can make continuous outbound calls while also providing timely and complete recording of conversations. Compared to manual outbound calls, outbound call robots not only improve outbound call efficiency and data integrity, but also reduce labor costs. Consequently, their application scenarios are becoming increasingly diverse. Outbound call robots utilize tailored response techniques for different call tasks. Some of these tasks require high real-time performance and require immediate dialing, while others require batch import and centralized processing.

[0003] Related technologies typically use a round-robin or multi-threaded approach to fairly process incoming calls across tasks in the order they were imported. This sequential outbound calling approach can lead to situations where some tasks are temporarily without incoming calls, or where all available line resources for outbound calls are fully occupied, resulting in idle calls. This idling problem undoubtedly reduces outbound call efficiency and squeezes outbound call tasks. It also wastes outbound call bot resources and makes it impossible to balance the dialing needs of outbound call tasks with different attributes and priorities. Summary of the Invention

[0004] The present disclosure provides a method for scheduling an outbound call task, an electronic device, a storage medium, and a computer program product.

[0005] According to one aspect of the present disclosure, a scheduling method for an outbound call task is provided, comprising: synchronizing the outbound call task to any task queue that does not contain the outbound call task based on a judgment result that the outbound call task satisfies an outbound call condition, so as to increase the number of queues to which the outbound call task belongs, wherein the outbound call condition includes the existence of a clue to be dialed and the existence of idle outbound call resources; based on a task extraction rule, calling a target task from each of the outbound call tasks in all the task queues, wherein the calling probability of the target task is proportional to the number of the corresponding queues; and updating the queue to which the target task belongs based on an analysis result of the outbound call parameters of the target task, so as to adjust the calling probability of the target task.

[0006] In some embodiments, according to the judgment result that the outbound call task meets the outbound call condition, the outbound call task is synchronized to any task queue that does not contain it to increase the number of queues to which the outbound call task belongs, including: according to the judgment result that the outbound call task meets the outbound call condition, the outbound call task is synchronized in sequence to a task queue of a higher level than the current corresponding task queue with the highest call priority to increase the number of queues to which the outbound call task belongs, wherein each of the task queues has a unique corresponding call priority, and each of the outbound call tasks in the same task queue has the same call priority.

[0007] In some embodiments, calling the target task from each of the outbound call tasks in all the task queues based on the task extraction rule includes: randomly calling the target task queue from all the task queues based on the task extraction rule; and randomly extracting tasks from the multiple outbound call tasks in the target task queue to determine the target task.

[0008] In some embodiments, updating the target task's belonging queue based on the analysis result of the outbound call parameters of the target task includes: in response to the analysis result that the outbound call parameters of the target task meet the outbound call conditions, synchronizing the target task to any task queue that does not contain it, so as to increase the number of the target task's belonging queues.

[0009] In some embodiments, updating the target task's belonging queue based on the analysis result of the outbound call parameters of the target task includes: in response to the analysis result that the outbound call parameters of the target task meet the outbound call conditions, synchronizing the target task in sequence to a task queue of a higher level than the current corresponding task queue with the highest call priority, so as to increase the number of the target task's belonging queues.

[0010] In some embodiments, updating the queue to which the target task belongs based on the analysis result of the outbound call parameters of the target task includes: in response to the analysis result that the outbound call parameters of the target task do not meet the outbound call conditions, removing the target task from any task queue to which it belongs, so as to reduce the number of queues to which the target task belongs.

[0011] In some embodiments, updating the queue to which the target task belongs based on the analysis result of the outbound call parameters of the target task includes: in response to the analysis result that the outbound call parameters of the target task do not meet the outbound call conditions, sequentially removing the target task from the task queue at a lower level than the task queue with the highest call priority currently corresponding to it, so as to reduce the number of queues to which the target task belongs.

[0012] According to another aspect of the present disclosure, an electronic device is provided, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the program, the method for scheduling outbound call tasks as described in any of the above embodiments is implemented.

[0013] According to another aspect of the present disclosure, a readable storage medium is provided, wherein the readable storage medium stores a computer program, and the computer program is suitable for being loaded by a processor to execute the method for scheduling outbound call tasks as described in any of the above embodiments.

[0014] According to another aspect of the present disclosure, a computer program product is provided, including a computer program / instruction, which, when executed by a processor, implements the method for scheduling outbound call tasks described in any of the above embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] The accompanying drawings illustrate exemplary embodiments of the present disclosure and together with the description serve to explain the principles of the present disclosure. These drawings are included to provide a further understanding of the present disclosure and are incorporated in and constitute a part of this specification.

[0016] Figure 1 The figure is a flow chart of a method for scheduling an outbound call task according to an exemplary embodiment of the present disclosure.

[0017] Figure 2 FIG. 4 is a schematic diagram of a task queue according to an exemplary embodiment of the present disclosure.

[0018] Figure 3 The present invention is a block diagram of an outbound call task scheduling method according to an exemplary embodiment of the present invention. DETAILED DESCRIPTION

[0019] The present disclosure will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only intended to explain the relevant content and are not intended to limit the present disclosure. It should also be noted that, for ease of description, only the portions relevant to the present disclosure are shown in the accompanying drawings.

[0020] It should be noted that, in the absence of conflict, the embodiments and features of the embodiments in the present disclosure can be combined with each other. The technical solution of the present disclosure will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0021] Unless otherwise stated, the exemplary embodiments / examples shown are to be understood as providing exemplary features of various details of some ways in which the technical concepts of the present disclosure can be implemented in practice. Therefore, unless otherwise stated, the features of the various embodiments / examples may be further combined, separated, interchanged, and / or rearranged without departing from the technical concepts of the present disclosure.

[0022] The terms used herein are for the purpose of describing specific embodiments, rather than being restrictive. As used herein, unless the context clearly indicates otherwise, the singular forms "one (kind, person)" and "said (the)" are also intended to include plural forms. In addition, when the terms "comprise" and / or "include" and their variations are used in this specification, the features, integral bodies, steps, operations, parts, assemblies and / or their groups stated are indicated, but the presence or addition of one or more other features, integral bodies, steps, operations, parts, assemblies and / or their groups is not excluded. It should also be noted that, as used herein, the terms "substantially", "approximately" and other similar terms are used as approximate terms and not as degree terms, and as such, they are used to explain the inherent deviations of the measured values, calculated values ​​and / or values ​​provided that will be recognized by those of ordinary skill in the art.

[0023] Figure 1 This is a flow chart of the method for scheduling outbound call tasks according to an exemplary embodiment of the present disclosure. Figure 1 The outbound call task scheduling method S100 disclosed in the present invention is described in detail.

[0024] Step S102: Based on the result of determining whether the outbound call task satisfies the outbound call condition, the outbound call task is synchronized to any task queue that does not contain the outbound call task, so as to increase the number of queues to which the outbound call task belongs.

[0025] Outbound call tasks are the result of categorizing the outbound call operations of an outbound call robot based on different execution scenarios and call purposes. Different execution scenarios and call purposes correspond to different outbound call tasks, and the outbound call robot will match the corresponding outbound call scripts to each outbound call task. In addition, each outbound call task has different task characteristics and processing requirements. For example, a return call task requires batch import and centralized processing, while a notification task requires small data volumes and timely processing.

[0026] An outbound call robot is a conversational robot based on artificial intelligence technology, capable of speech recognition, semantic understanding, and speech synthesis. It can make continuous outbound calls and simultaneously record conversations in a timely and complete manner.

[0027] Outbound call conditions include the existence of pending leads and idle outbound call resources. A pending lead refers to a phone call that needs to be dialed by an outbound call robot, such as a phone call for a return call or notification. Idle outbound call resources refer to currently available lines for calling pending leads. When an outbound call task meets the outbound call conditions, it means that the task will not idle when called. At this time, the priority of the outbound call task can be upgraded, that is, it will be synchronized to any task queue that does not contain the outbound call task. This increases the number of queues containing the outbound call task (that is, the queue to which the outbound call task belongs) among all task queues, thereby increasing the probability of the outbound call task being called among all task queues.

[0028] Based on outbound call demand, leads to be dialed can be imported into each outbound call task in batches or in small quantities at any time. Therefore, at the same time, the same outbound call task can contain multiple leads to be dialed, or there may be no leads to be dialed. If there are no leads to be dialed in the outbound call task being called, it will idle. Frequent idleness will waste resources and exacerbate the backlog of outbound call tasks. By adding queues to outbound call tasks that meet the outbound call conditions and deleting queues to outbound call tasks that do not meet the outbound call conditions, the probability of calling outbound call tasks that meet the outbound call conditions is increased, the probability of calling outbound call tasks that do not meet the outbound call conditions is reduced, the probability of idleness is reduced, and the backlog of outbound call tasks is alleviated.

[0029] Of course, if an outbound call task has pending leads but all outbound call resources are occupied, it may idle, meaning that the pending leads cannot be successfully called. In this case, you can also adjust the number of queues to which the outbound call task belongs and the probability of retrieval of the outbound call task, thereby reducing the probability of idle, and alleviating the backlog of outbound call tasks.

[0030] Step S104: According to the task extraction rule, the target task is retrieved from all outbound call tasks in the task queue.

[0031] Task extraction rules are pre-defined rules for instructing the retrieval of target tasks, and can be, for example, random. Specifically, because step S102 increases the assigned queue for outbound call tasks that meet the outbound call conditions and decreases the assigned queue for outbound call tasks that do not meet the conditions each time a task is retrieved, when a random task extraction rule is used to retrieve the target task, the probability of extracting outbound call tasks that meet the outbound call conditions is greater than the probability of extracting outbound call tasks that do not meet the conditions, thereby reducing the probability of idle tasks. Clearly, the probability of a target task being retrieved is proportional to the number of assigned queues to which it belongs.

[0032] The target task is any outbound call task randomly selected from all task queues. This is the task the outbound call robot is currently preparing to execute. When the target task meets the outbound call conditions, a target lead (i.e., any pending lead included in the target task) is randomly selected from the target task and the call, conversation, and recording with the target lead are completed using the scripts corresponding to the target task.

[0033] Step S106 : Based on the analysis result of the outbound call parameters of the target task, the target task's belonging queue is updated to adjust the probability of the target task being called.

[0034] The analysis results include whether the target task's outbound call parameters meet the outbound call requirements, or whether they do not. If the target task has pending leads and available outbound call resources, the outbound call robot can successfully extract and call any pending leads in the target task and record the conversation results. In this case, the number of queues assigned to the target task can be increased to increase the probability of the target task being called. Conversely, the number of queues assigned to the target task can be reduced to reduce the probability of the target task being called and the chance of idle calls.

[0035] Figure 2 FIG. 4 is a schematic diagram of a task queue according to an exemplary embodiment of the present disclosure.

[0036] refer to Figure 2 In some embodiments, step S102 includes: according to the judgment result that the outbound call task meets the outbound call condition, the outbound call task is synchronized in sequence to a task queue of a higher level than the current corresponding task queue with the highest call priority, so as to increase the number of queues to which the outbound call task belongs.

[0037] That is, task queues are divided according to call priorities, and each task queue is sorted according to the call priorities, so that when adjusting the queue to which an outbound call task belongs, it can be upgraded or downgraded according to the call priorities. Among them, each task queue has a unique corresponding call priority, and all outbound call tasks in the same task queue have the same call priority.

[0038] For example, the task queue is divided into ten task queues with gradually increasing call priorities, namely P1, P2, P3, P4, P5, P6, P7, P8, P9 and P10. Among them, the task set (task queue) P1 includes all outbound call tasks, regardless of whether the outbound call tasks meet the outbound call conditions, so as to avoid missing outbound call tasks that originally had no leads to be dialed or no idle outbound call resources, but suddenly introduced new leads to be dialed and / or outbound call resources are suddenly idle.

[0039] First, all open tasks are placed in P1, and each outbound task is initialized. Then, each time an outbound task is selected as a target task, its outbound call parameters are analyzed and determined to see if they meet the outbound call conditions. If so, the task is synchronized to P2. At this point, the task exists in both P1 and P2. In subsequent random draws, its weight increases, and its probability of being selected increases accordingly. If it does not meet the outbound call conditions, the task remains in P1. Furthermore, if the next outbound task selected is from P2 and meets the outbound call conditions, it is synchronized to P3. Now, the task exists in P1, P2, and P3, increasing its probability of being selected the next time the target task is drawn. Otherwise, if the task does not meet the outbound call conditions, it is removed from P2, leaving it in P1 alone, and its probability of being selected the next time the target task is drawn decreases. After meeting the outbound call conditions multiple times, an outbound call task can be promoted to P10. At this time, the proportion of tasks called is the largest, which means that tasks in P10 are the highest priority tasks. Task P8 means that tasks in P8 must exist in P1 to P7, that is, P1 to P8 are the queues to which this outbound call task belongs; Task P10 means that tasks in P10 must exist in P1 to P9, that is, P1 to P9 are the queues to which this outbound call task belongs. Based on the above dynamic adjustment, each outbound call task always exists in at least one task queue.

[0040] In some embodiments, step S104 includes: randomly selecting a target task queue from all task queues according to a task extraction rule; and randomly extracting tasks from multiple outbound call tasks in the target task queue to determine the target task.

[0041] The target task is retrieved using random selection as the task extraction rule. The extraction opportunities for each task queue from P1 to P10 are equal. However, since the outbound call tasks in higher priority task queues have more belonging queues, for example, the outbound call tasks in P10 have the opportunity to be retrieved regardless of which task queue from P1 to P10 is drawn. Compared with the outbound call tasks that only exist in P1, the outbound call tasks have a higher probability of being retrieved.

[0042] In some embodiments, the call probability of each outbound call task is C = P / N, where P is the maximum call priority level in the queue to which the outbound call task belongs, and N is the total number of outbound call tasks in the extracted task queue. For example, if the maximum call priority level in the queue to which a certain outbound call task belongs is P10, then P is 10; if the extracted P8 contains 10 outbound call tasks, then N is 10, and the call probability is 1. If the maximum call priority level in the queue to which a certain outbound call task belongs is P9, then P is 9; if P8 contains 10 outbound call tasks, then N is 10. The call probability is 0.9. Obviously, the higher the call priority level of the queue to which the outbound call task belongs, the greater the call probability; conversely, the lower the priority level, the smaller the call probability. This ensures that high-priority outbound call tasks have a greater chance of being processed, while also ensuring that every outbound call task has the opportunity to be processed promptly.

[0043] In some embodiments, step S106 includes: in response to the analysis result that the outbound call parameters of the target task meet the outbound call conditions, synchronizing the target task to any task queue that does not contain it, so as to increase the number of queues to which the target task belongs.

[0044] In some embodiments, step S106 may also be: in response to the analysis result that the outbound call parameters of the target task meet the outbound call conditions, the target task is synchronized in sequence to a task queue of a higher level than the current corresponding task queue with the highest call priority, so as to increase the number of queues to which the target task belongs.

[0045] In some embodiments, step S106 includes: in response to the analysis result that the outbound call parameters of the target task do not meet the outbound call conditions, removing the target task from any task queue to which it belongs, so as to reduce the number of queues to which the target task belongs.

[0046] In some embodiments, step S106 may also be: in response to the analysis result that the outbound call parameters of the target task do not meet the outbound call conditions, the target task is sequentially removed from the task queue of a lower level than the current corresponding highest call priority task queue to reduce the number of queues to which the target task belongs.

[0047] That is, the target task's belonging queue may be randomly added or deleted, or the target task's belonging queue may be sequentially added or deleted according to the calling priority.

[0048] If the target task's belonging queues are randomly added or deleted, then the probability of calling the outbound task is C=M / N, where M is the total number of the outbound task's belonging queues.

[0049] According to the scheduling method for outbound call tasks provided by the present invention, the number of queues to which the outbound call tasks belong is reduced or increased according to the analysis results of each outbound call task when it is called, so as to control the calling probability of each outbound call task, thereby achieving the calling probability of the outbound call tasks that meet the outbound call conditions, while taking into account the demand for timely processing of the to-be-dialed clues corresponding to each outbound call task, reducing the probability of idling, alleviating the backlog of tasks, and reducing the waste of resources caused by idling.

[0050] Figure 3 The present invention is a block diagram of an outbound call task scheduling method according to an exemplary embodiment of the present invention.

[0051] like Figure 3 As shown, the present disclosure proposes a scheduling device 1000 for outbound call tasks, which may include: a task grouping module 1002, a task retrieval module 1004 and an affiliation queue adjustment module 1006. The task grouping module 1002 is used to synchronize the outbound call task to any task queue that does not contain it based on the judgment result that the outbound call task meets the outbound call condition, so as to increase the number of affiliation queues of the outbound call task, wherein the outbound call condition includes the existence of clues to be dialed and the existence of idle outbound call resources. The task retrieval module 1004 is used to retrieve the target task from each outbound call task in all task queues according to the task extraction rules, wherein the retrieval probability of the target task is proportional to the number of affiliation queues to which it corresponds. The affiliation queue adjustment module 1006 is used to update the affiliation queue of the target task based on the analysis result of the outbound call parameters of the target task, so as to adjust the retrieval probability of the target task.

[0052] The various modules of the outbound call task scheduling device 1000 are provided to implement various steps of the outbound call task scheduling method. The implementation methods and principles of the various modules can be referred to above and will not be described in detail here.

[0053] The apparatus 1000 may include corresponding modules for executing each or several steps in the above flowchart. Therefore, each step or several steps in the above flowchart may be executed by a corresponding module, and the apparatus may include one or more of these modules. The modules may be one or more hardware modules specifically configured to execute the corresponding steps, or implemented by a processor configured to execute the corresponding steps, or stored in a computer-readable medium for execution by a processor, or implemented by some combination thereof.

[0054] The hardware structure can be implemented using a bus architecture. The bus architecture can include any number of interconnecting buses and bridges, depending on the specific application and overall design constraints of the hardware. Bus 1100 connects various circuits including one or more processors 1200, memory 1300, and / or hardware modules. Bus 1100 can also connect various other circuits 1400 such as peripherals, voltage regulators, power management circuits, external antennas, etc.

[0055] Bus 1100 may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, or an Extended Industry Standard Component Architecture (EISA) bus. Buses can be classified as address buses, data buses, control buses, and the like. For ease of illustration, this figure shows only one connecting line, but this does not imply that there is only one bus or only one type of bus.

[0056] According to the scheduling device for outbound call tasks provided by the present invention, the number of queues to which the outbound call tasks belong is reduced or increased according to the analysis results of each outbound call task when it is called, so as to control the calling probability of each outbound call task, thereby achieving the calling probability of the outbound call tasks that meet the outbound call conditions, while taking into account the demand for timely processing of the to-be-dialed clues corresponding to each outbound call task, reducing the probability of idling, alleviating the backlog of tasks, and reducing the waste of resources caused by idling.

[0057] Any process or method description in the flowchart or otherwise described herein can be understood to represent a module, fragment or portion of code including one or more executable instructions for implementing the steps of a specific logical function or process, and the scope of the preferred embodiments of the present disclosure includes alternative implementations in which the functions may not be performed in the order shown or discussed, including performing the functions in a substantially simultaneous manner or in a reverse order depending on the functions involved, which should be understood by those skilled in the art to which the embodiments of the present disclosure belong. The processor performs the various methods and processes described above. For example, the method embodiments of the present disclosure can be implemented as a software program that is tangibly contained in a machine-readable medium, such as a memory. In some embodiments, part or all of the software program can be loaded and / or installed via a memory and / or a communication interface. When the software program is loaded into the memory and executed by the processor, one or more steps in the method described above can be performed. Alternatively, in other embodiments, the processor can be configured to perform one of the above methods in any other appropriate manner (e.g., by means of firmware).

[0058] The logic and / or steps represented in the flowchart or otherwise described herein may be embodied in any readable storage medium for use by, or in conjunction with, an instruction execution system, apparatus, or device (such as a computer-based system, a system including a processor, or other system that can fetch and execute instructions from an instruction execution system, apparatus, or device).

[0059] For the purposes of this specification, a "readable storage medium" can be any device that can contain, store, communicate, propagate or transmit a program for use with or in conjunction with an instruction execution system, device or apparatus. More specific examples (a non-exhaustive list) of readable storage media include the following: an electrical connection having one or more wires (electronic device), a portable computer disk cartridge (magnetic device), a random access memory (RAM), a read-only memory (ROM), an erasable and editable read-only memory (EPROM or flash memory), a fiber optic device, and a portable read-only memory (CDROM). In addition, the readable storage medium can even be paper or other suitable medium on which the program can be printed, since the program can be obtained electronically, for example, by optically scanning the paper or other medium and then editing, interpreting or processing it in other suitable ways as necessary, and then storing it in a memory.

[0060] It should be understood that various parts of the present disclosure can be implemented using hardware, software, or a combination thereof. In the above-described embodiments, multiple steps or methods can be implemented using software stored in a memory and executed by a suitable instruction execution system. For example, if implemented using hardware, as in another embodiment, any one of the following technologies known in the art or a combination thereof can be used to implement the hardware: a discrete logic circuit having a logic gate circuit for implementing a logic function on a data signal, an application-specific integrated circuit having a suitable combination of logic gate circuits, a programmable gate array (PGA), a field programmable gate array (FPGA), etc.

[0061] Those skilled in the art will understand that all or part of the steps of the above-mentioned implementation method can be accomplished by instructing related hardware through a program, and the program can be stored in a readable storage medium. When the program is executed, it includes one or a combination of the steps of the method implementation method.

[0062] Furthermore, the functional units in the various embodiments of the present disclosure may be integrated into a single processing module, each unit may exist physically separately, or two or more units may be integrated into a single module. The aforementioned integrated modules may be implemented in the form of hardware or software functional modules. If the integrated modules are implemented as software functional modules and sold or used as independent products, they may also be stored in a readable storage medium. The storage medium may be a read-only memory, a magnetic disk, or an optical disk, etc.

[0063] The present disclosure also provides a computer program product, including a computer program / instruction, which implements the method for implementing video processing in any embodiment of the present disclosure when the computer program / instruction is executed by a processor.

[0064] In the description of this specification, the description with reference to the terms "one embodiment / method", "some embodiments / methods", "specific examples", or "some examples" means that the specific features, structures, materials or characteristics described in conjunction with the embodiment / method or example are included in at least one embodiment / method or example of the present disclosure. In this specification, the schematic representations of the above terms are not necessarily the same embodiment / method or example. Moreover, the specific features, structures, materials or characteristics described may be combined in a suitable manner in any one or more embodiments / methods or examples. In addition, those skilled in the art may combine and combine the different embodiments / methods or examples described in this specification and the features of the different embodiments / methods or examples, unless they are mutually contradictory.

[0065] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features being referred to. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. Throughout the present disclosure, "plurality" means at least two, such as two, three, etc., unless otherwise specifically defined.

[0066] Those skilled in the art will appreciate that the above embodiments are merely intended to clearly illustrate the present disclosure and are not intended to limit the scope of the present disclosure. Other changes or modifications may be made based on the above disclosure, and such changes or modifications are still within the scope of the present disclosure.

Claims

1. A method for scheduling outbound call tasks, characterized in that: include: Synchronize the outbound call task to any task queue that does not contain it, based on the result of determining whether the outbound call task meets the outbound call conditions, so as to increase the number of queues to which the outbound call task belongs, wherein the outbound call conditions include the existence of waiting leads and the existence of idle outbound call resources; According to a task extraction rule, a target task is retrieved from each of the outbound call tasks in all the task queues, wherein the probability of retrieval of the target task is proportional to the number of the corresponding queues; and Based on the analysis result of the outbound call parameters of the target task, updating the belonging queue of the target task to adjust the call probability of the target task; The updating of the target task's belonging queue based on the analysis result of the outbound call parameter of the target task includes: In response to an analysis result that the outbound call parameter of the target task satisfies the outbound call condition, synchronizing the target task to any task queue that does not contain the target task, so as to increase the number of queues to which the target task belongs; In response to the analysis result that the outbound call parameter of the target task does not meet the outbound call condition, the target task is removed from any task queue to which it belongs, so as to reduce the number of queues to which the target task belongs.

2. The outbound call task scheduling method according to claim 1, characterized in that: The step of synchronizing the outbound call task to any task queue that does not contain the outbound call task based on the result of determining whether the outbound call task satisfies the outbound call condition, so as to increase the number of queues to which the outbound call task belongs, includes: According to the judgment result that the outbound call task meets the outbound call conditions, the outbound call task is synchronized in sequence to a task queue of a higher level than the current corresponding task queue with the highest call priority, so as to increase the number of queues to which the outbound call task belongs, wherein each task queue has a unique corresponding call priority, and each outbound call task in the same task queue has the same call priority.

3. The outbound call task scheduling method according to claim 1 or 2, characterized in that: The step of extracting a target task from each of the outbound call tasks in all the task queues according to the task extraction rule includes: According to the task extraction rule, randomly call a target task queue from all the task queues; and Random task extraction is performed among the multiple outbound call tasks in the target task queue to determine the target task.

4. The outbound call task scheduling method according to claim 1, characterized in that: The updating of the target task's belonging queue based on the analysis result of the outbound call parameter of the target task includes: In response to the analysis result that the outbound call parameters of the target task meet the outbound call conditions, the target task is synchronized in sequence to a task queue of a higher level than the current corresponding task queue with the highest call priority, so as to increase the number of queues to which the target task belongs.

5. The outbound call task scheduling method according to claim 1, characterized in that: The updating of the target task's belonging queue based on the analysis result of the outbound call parameter of the target task includes: In response to the analysis result that the outbound call parameters of the target task do not meet the outbound call conditions, the target task is sequentially removed from the task queues of a lower level than the current corresponding task queue with the highest call priority, so as to reduce the number of queues to which the target task belongs.

6. An electronic device, characterized in that: The system comprises a memory, a processor and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the method for scheduling an outbound call task as claimed in any one of claims 1 to 5 is implemented.

7. A readable storage medium, characterized in that: The readable storage medium stores a computer program, and the computer program is suitable for being loaded by a processor to execute the outbound call task scheduling method according to any one of claims 1 to 5.

8. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instruction is executed by a processor, the method for scheduling outbound call tasks according to any one of claims 1 to 5 is implemented.

Images