WO2022095358A1

WO2022095358A1 - Task scheduling method and apparatus, electronic device, and readable storage medium

Info

Publication number: WO2022095358A1
Application number: PCT/CN2021/090716
Authority: WO
Inventors: 邹芳; 李彦良; 黄鹏; 刘鑫; 赵永超
Original assignee: 平安科技（深圳）有限公司
Priority date: 2020-11-06
Filing date: 2021-04-28
Publication date: 2022-05-12
Also published as: CN112306661B; CN112306661A

Abstract

A task scheduling method and apparatus, an electronic device, and a computer-readable storage medium, which relate to Internet technology. The method comprises: sorting all tasks in a set of tasks to be scheduled, so as to obtain a standard set of tasks to be scheduled, and performing a scheduling process, which includes sequential allocation and insertion scheduling, on tasks in the standard set of tasks to be scheduled, so as to obtain a standard scheduled task table; randomly disrupting, multiple times, the order of the tasks in the standard set of tasks to be scheduled, so as to obtain a plurality of random sets of tasks to be scheduled; performing the same scheduling process on the random sets of tasks to be scheduled as that on the standard set of tasks to be scheduled, so as to obtain random standard scheduled task table sets; performing screening on the random standard scheduled task table sets according to the standard scheduled task table, so as to obtain a task scheduling table; and performing task scheduling according to the task scheduling table. The task scheduling table can be stored in a blockchain. By means of the method, the efficiency of multi-task scheduling can be improved.

Description

Task scheduling method, apparatus, electronic device, and readable storage medium

This application claims the priority of the Chinese patent application with the application number CN202011229916.6 and the title of "Task Scheduling Method, Device, Electronic Device and Readable Storage Medium", which was filed with the Chinese Patent Office on November 06, 2020, the entire contents of which are Incorporated herein by reference.

technical field

The present application relates to the field of Internet technologies, and in particular, to a task scheduling method, apparatus, electronic device, and readable storage medium.

Background technique

With the development of computer technology, there is a situation of scheduling multi-task execution in the process of computer operation. Reasonably arranging the execution sequence of multi-tasks is beneficial to shorten the overall task execution time and improve the efficiency of task execution.

Currently, the first-come, first-served scheduling scheme based on task priority is used in many fields, such as thread scheduling in the operating system, scheduling of workshop workpieces on the production line, etc. The inventor realizes that although this strategy is simple and effective, in some business scenarios, due to the relatively rich attributes of tasks to be scheduled, better resource usage and even user experience cannot be guaranteed, such as financial settlement related to e-commerce in the banking system. The efficiency of business task scheduling directly affects the user's shopping experience, so a better task scheduling method is needed to improve the efficiency of multi-task scheduling.

SUMMARY OF THE INVENTION

A task scheduling method provided by this application includes:

Obtaining a task set to be scheduled, sorting the task set to be scheduled, and obtaining a standard task set to be scheduled;

Scheduling and assigning tasks in the standard to-be-scheduled task set in order to obtain an initial task schedule and an unscheduled task set;

Perform insertion scheduling on all tasks in the unscheduled task set according to the initial scheduled task table to obtain a standard scheduled task table;

Randomly shuffle the tasks in the standard task set to be scheduled for multiple times to obtain multiple random task sets to be scheduled;

Scheduling and assigning tasks in the random task set to be scheduled in order to obtain a random initial task schedule and a random unscheduled task set;

Performing insertion scheduling on all tasks in the random unscheduled task set according to the random initial scheduling task table, obtaining a random standard scheduling task table, summarizing all the random standard scheduling task tables, and obtaining a random standard scheduling task table set;

Screening the random standard scheduling task table set according to the standard scheduling task table to obtain one or more to-be-selected scheduling tables;

From the multiple schedule tables to be selected, select one of the schedule tables to be selected as the task schedule table according to a preset rule;

Task scheduling is performed according to the task scheduling table.

The present application also provides a task scheduling device, the device comprising:

The scheduling table generation module is used to obtain the task set to be scheduled, sort the task set to be scheduled, and obtain a standard task set to be scheduled; schedule and assign tasks in the standard task set to be scheduled in order to obtain an initial task scheduling table and unscheduled task set; perform insertion scheduling on all tasks in the unscheduled task set according to the initial scheduled task table, and obtain a standard scheduled task table; randomly shuffle the order of the tasks in the standard to-be-scheduled task set for many times, Obtain a plurality of random task sets to be scheduled; schedule and assign tasks in the random task set to be scheduled in order to obtain a random initial task schedule and a random unscheduled task set; All tasks in the scheduling task set are inserted and scheduled to obtain a random standard scheduling task table, and all the random standard scheduling task tables are aggregated to obtain a random standard scheduling task table set; according to the standard scheduling task table, the random standard scheduling task Filter the table set to obtain one or more scheduling tables to be selected;

The scheduling table screening module is used to select one of the scheduling tables to be selected as the task scheduling table according to a preset rule from the plurality of scheduling tables to be selected;

The scheduling table scheduling module is configured to perform task scheduling according to the task scheduling table.

The present application also provides an electronic device, the electronic device comprising:

a memory that stores at least one computer program; and

The processor executes the computer program stored in the memory to realize the following steps:

Task scheduling is performed according to the task scheduling table.

The present application also provides a computer-readable storage medium, where at least one computer program is stored in the computer-readable storage medium, and the at least one computer program is executed by a processor in an electronic device to implement the following steps:

Task scheduling is performed according to the task scheduling table.

Description of drawings

FIG. 1 is a schematic flowchart of a task scheduling method provided by an embodiment of the present application;

2 is a schematic flowchart of obtaining one or more scheduling tables to be selected in a task scheduling method provided by an embodiment of the present application;

FIG. 3 is a schematic block diagram of a task scheduling apparatus provided by an embodiment of the present application;

4 is a schematic diagram of the internal structure of an electronic device for implementing a task scheduling method provided by an embodiment of the present application;

The realization, functional characteristics and advantages of the purpose of the present application will be further described with reference to the accompanying drawings in conjunction with the embodiments.

Detailed ways

It should be understood that the specific embodiments described herein are only used to explain the present application, but not to limit the present application.

The embodiment of the present application provides a task scheduling method. The execution subject of the task scheduling method includes, but is not limited to, at least one of electronic devices that can be configured to execute the method provided by the embodiments of the present application, such as a server and a terminal. In other words, the task scheduling method can be executed by software or hardware installed on a terminal device or a server device, and the software can be a blockchain platform. The server includes but is not limited to: a single server, a server cluster, a cloud server or a cloud server cluster, and the like.

Referring to the schematic flowchart of the task scheduling method provided by an embodiment of the present application shown in FIG. 1 , in the embodiment of the present application, the task scheduling method includes:

S1. Obtain a task set to be scheduled, and sort the task set to be scheduled to obtain a standard task set to be scheduled;

In this embodiment of the present application, the set of tasks to be scheduled is a set of multiple tasks to be scheduled, such as multiple programs to be executed, threads to be executed, and the like. Further, the tasks to be scheduled have corresponding task information marks, wherein the task information includes: task name, task plan start time, task latest deadline, task expected execution time, task priority, task executable list of objects, etc. Wherein, the task executable object list is a list of numbers or names of the task executable objects, indicating which execution objects the task can be executed on. For example: task a can be executed on execution objects B, C, and D, then The executable object list of task a includes: execution objects B, C and D. The execution object is a carrier for task execution, such as a computer, a computer cluster, and the like.

Further, in order to save the scheduling allocation time in the embodiment of the present application, it is necessary to sort all the tasks to be scheduled included in the task set to be scheduled first. All tasks to be scheduled in the set of tasks to be scheduled are sorted according to the priority of the task and the scheduled start time of the task to obtain the standard set of tasks to be scheduled.

In detail, in the embodiment of the present application, sorting all tasks to be scheduled in the set of tasks to be scheduled according to the task priority corresponding to each task to be scheduled in the set of tasks to be scheduled and the planned start time of the task, including: The to-be-scheduled tasks in the to-be-scheduled task set are sorted according to the task priorities to obtain an initial to-be-scheduled task set; The standard set of tasks to be scheduled.

S2, scheduling and assigning tasks in the standard to-be-scheduled task set in order to obtain an initial task scheduling table and an unscheduled task set;

In order to better schedule tasks, the embodiment of the present application extracts the execution objects in the executable object list corresponding to each to-be-scheduled task in the standard to-be-scheduled task set, and performs a summary and deduplication process on the extracted execution objects to obtain Execute the object set.

For example: there are two tasks to be scheduled in the standard task set to be scheduled, task O and task Q, the executable object list of task O includes execution objects B and C, and the executable object list of task Q includes execution objects C and D. , and perform deduplication processing by summarizing execution objects B and C and execution objects C and D to obtain execution object sets B, C, and D.

Further, in order to make better use of the execution objects in the execution object set, it is necessary to know the task scheduling situation of each execution object. Therefore, in this embodiment of the present application, the execution object scheduling of each execution object in the execution object set is obtained. A task set, wherein the execution object scheduling task set is a set of tasks that have been scheduled in the execution object, and each task in the execution object scheduling task set contains corresponding task scheduling information, including: task scheduling start time, task scheduling Estimated execution time, latest task deadline, and task scheduling execution object. In this embodiment of the present application, one execution object can only execute one task at the same time. Further, the embodiment of the present application schedules and allocates tasks in the standard task set to be scheduled according to the execution object set and the execution object scheduling task set in sequence, so as to obtain an initial task scheduling table and an unscheduled task set.

In detail, according to the embodiment of the present application, the tasks in the standard to-be-scheduled task set are scheduled and allocated in order to obtain an initial task schedule and an unscheduled task set, including:

Step A, extracting a task to be scheduled Task _i from the standard task set to be scheduled by traversing operation;

Step B, sorting the extracted execution objects in the executable object list of the to-be-scheduled task Task _i according to the execution object scheduling task set to obtain a first standard execution object list;

For example, the executable object list of the task to be scheduled Task _i includes: execution objects B, C, D, the number of tasks in the execution object scheduling task set corresponding to execution object B is 2, and the execution object corresponding to execution object C in the execution object scheduling task set is 2 tasks. The number of tasks is 5, and the number of tasks in the execution object scheduling task set corresponding to execution object D is 3. According to the number of tasks in the execution object scheduling task set corresponding to the execution object, the list of executable objects of the to-be-scheduled task Task _i is compared. The execution objects are sorted according to the order of execution objects to obtain the first standard execution object list of the task Task _i to be scheduled. The execution objects in the first standard execution object list are execution object C, execution object D, and execution object B in sequence.

Step C, extract a standard execution object Machine _j from the first standard execution object list by traversing operation;

Step D, extract the scheduling time of each task in the execution scheduling task set of the standard execution object, and judge whether the extracted scheduling time has a time conflict with the planning scheduling time included in the task Task _i to be scheduled; If there is no time conflict in the extracted planned scheduling time of the to-be-scheduled task Task _i , then directly schedule the to-be-scheduled task Task _i , and add the directly-scheduled to-be-scheduled task Task _i to the execution scheduling task set , and return to step A, until the task traversal in the standard to-be-scheduled task set is completed; if there is a time conflict between all the scheduling times and the planned scheduling time corresponding to the to-be-scheduled task Task _i , the to-be-scheduled task Task i _i is determined to be an unscheduled task, and returns to step C until the task traversal in the standard to-be-scheduled task set is completed;

The embodiment of the present application extracts the task scheduling time of each task according to the task scheduling information contained in each task in the execution object scheduling task set, for example: the task start time in the task scheduling information of task A is 8:00 and the task's estimated execution time is 30 minutes, then the scheduling time of task A is 8:00 to 8:30.

In detail, the time conflict in the embodiments of the present application refers to the overlapping part of the time interval, for example, the scheduling time o is from 8:00 to 8:30, and the planned scheduling time p is from 8:15 to 8:45. The time intervals overlap, so the scheduling time o and the planned scheduling time p have a time conflict.

Further, the direct scheduling of the to-be-scheduled task Task _i in the embodiment of the present application includes: determining the corresponding planned scheduling time of the to-be-scheduled task Task _i as the scheduling time, and determining the scheduling execution object.

Step E: Summarize all execution object scheduling task sets to obtain an initial scheduled task table, and sort and summarize all the unscheduled tasks to obtain an unscheduled task set.

In detail, the embodiment of the present application summarizes the execution object scheduling task set of all execution objects according to the execution object set, obtains an initial scheduling task table, and assigns all the unscheduled tasks according to the corresponding order of the standard to-be-scheduled task set. Sort and summarize in order to get the set of unscheduled tasks.

S3, performing insertion scheduling on all tasks in the unscheduled task set according to the initial scheduling task table to obtain a standard scheduling task table;

In one of the embodiments of the present application, if the number of tasks in the unscheduled task set is zero, it means that all tasks in the to-be-scheduled task set have been scheduled, and the initial scheduled task table is determined as a standard scheduled task table.

In another embodiment of the present application, if the number of tasks in the unscheduled task set is not zero, insert scheduling is performed on all tasks in the unscheduled task set according to the initial scheduled task table to obtain a standard scheduled task table.

In detail, in order to minimize the delay time of the execution object of the task scheduling in the unscheduled task set, in this embodiment of the present application, the insertion scheduling is performed on all tasks in the unscheduled task set according to the initial scheduled task table. , get the standard schedule task table, including:

Step a, sequentially extracting an unscheduled task Task _q from the unscheduled task set through a traversal operation;

Step b, sorting the execution objects in the executable object list of the unscheduled task Task _q according to the execution object scheduling task set to obtain a second standard execution object list;

Step c. Take out a standard execution object in turn from the first standard execution object list through a traversal operation, select all tasks in the execution scheduling task set corresponding to the standard execution object that meet the preset insertion conditions, and obtain an insertion task set, wherein , the insertion condition is that the task scheduling start time is greater than or equal to the task planning start time of the unscheduled task Task _q , the first task Task _s in the task set is inserted, and the last task is Task _send .

Step d, attempt to insert described unscheduled task Task _q into the gap between the second task Task _s-1 and the first task Task _s in the described insertion task set, and adjust the insertion of task Task _s and the execution object thereafter All scheduled tasks in the task set are until there is no conflict; if the adjustment result causes the last task Task _send to be inserted into the task set to be abandoned, then continue to try to insert the unscheduled task Task _q into the next gap; if the adjustment result satisfies the condition, then jump Go to step e below.

For example, there are two tasks in the inserted task set, A and B respectively, the scheduling time of task A is 10:00 to 10:30, the scheduling time of task B is 10:45 to 11:30, and the scheduling time of task C is not scheduled. The scheduled scheduling time is from 9:00 to 9:30. Insert unscheduled task C into the gap between task A and task B for insertion scheduling. Then the scheduling time of unscheduled task C is from 10:30 to 11:00. To avoid conflicts The scheduling time of task B is adjusted and delayed to 11:00 to 11:45. In this embodiment of the present application, if the scheduling end time of a task is greater than the latest task deadline of the task, the task is discarded.

Step e. Count the delay time of the execution object after the unscheduled task Task _q is inserted into the gap. If the delay time is less than the delay time calculated before, update the minimum delay time of the execution object and record the gap.

In detail, the delay time calculation formula in the embodiment of the present application is as follows:

Among them, n is the total number of scheduled tasks of the execution object, q is the scheduled tasks in the execution object, RealStartTime _q is the task scheduling start time, ExecutionTime _q is the expected execution time of the task, and EndTime _q is the latest deadline for the task.

Step f, mark whether the execution object can be scheduled, and update the information of the minimum delay time, and jump to the above step c, until all the execution objects in the standard execution object list of the unscheduled task Task _q are traversed.

Step g, choose the execution object with the minimum schedulable minimum delay time in the standard execution object list corresponding to the unscheduled task Task _q , insert the unscheduled task Task _q into the gap recorded in step e, and return to step a , until all the unscheduled task sets in the unscheduled task set are traversed, and the standard scheduled task table is obtained by counting the task information of each task in the standard unscheduled task set at this time.

S4, randomly shuffling the tasks in the standard task set to be scheduled multiple times to obtain multiple random task sets to be scheduled;

The standard scheduling task table may be locally optimal scheduling. In order to obtain the global optimal scheduling, the embodiment of the present application randomly shuffles the tasks in the standard to-be-scheduled task set multiple times to obtain multiple random to-be-scheduled task sets.

In detail, in the embodiment of the present application, randomly shuffling the order of tasks in the standard to-be-scheduled task set for multiple times to obtain multiple random to-be-scheduled task sets includes: arranging the tasks in the standard to-be-scheduled task set according to the predetermined order. The set sorting rule set is sorted multiple times to obtain a plurality of the random task sets to be scheduled, wherein the sorting rules in the sorting rule set include: task estimated execution time sorting, task priority sorting and/or task planning start time sorting .

S5, scheduling and assigning tasks in the random task set to be scheduled in order to obtain a random initial task schedule and a random unscheduled task set;

In this embodiment of the present application, the method for sequentially scheduling and assigning tasks in the random task set to be scheduled is the same as the above S2, and details are not described herein again.

Further, if the number of tasks in the random unscheduled task set is zero, it means that all tasks in the random to-be-scheduled task set have been scheduled, and the random initial task scheduling table is determined as a random standard task scheduling table; if If the number of tasks in the random unscheduled task set is not zero, shuffle the tasks in the random initial unscheduled task set according to a preset sorting rule to obtain a random unscheduled task set, and according to the random initial task scheduling table Perform insertion scheduling on all tasks in the random unscheduled task set to obtain a random standard task scheduling table.

S6, performing insertion scheduling on all tasks in the random unscheduled task set according to the random initial scheduling task table, to obtain a random standard scheduling task table, and summarizing all the random standard scheduling task tables to obtain a random standard scheduling task table set;

In detail, the method for performing insertion scheduling on all tasks in the random unscheduled task set according to the random initial scheduling task table described in the embodiment of the present application is the same as the above-mentioned S3, and details are not repeated here.

S7. Screen the random standard scheduling task table set according to the standard scheduling task table to obtain one or more scheduling tables to be selected;

In the embodiment of the present application, referring to FIG. 2 , the random standard scheduling task table set is screened according to the standard scheduling task table to obtain one or more to-be-selected scheduling tables, including:

S71, using the target optimization function to calculate the optimization function value of each random standard scheduling task table set in the random standard scheduling task table set;

In detail, the embodiment of the present application uses the following objective optimization function to calculate the optimization function value F of each random standard scheduling task table set in the random standard scheduling task table set:

F=f ₁ +f ₂ +f ₃

f ₁ =Σ(StartTime _i +ExecutionTime _i -EndTime _i )

Among them, f ₁ is the task delay time optimization function, f ₂ is the number of tasks discarded, f ₃ is the optimization function of the minimum number of executors, StartTime _i is the task plan start time of task i, and ExecutionTime _i is the estimated execution time of task i , EndTime _i is the latest deadline of the task, Machine _j is the jth execution object in the execution object set, t is the execution time of the task i, and M is the execution object set.

S72, using the target optimization function to calculate the optimization function value of the standard scheduling task table;

S73, selecting a random standard scheduling task table whose optimization function value in the random standard scheduling task table is less than or equal to the optimization function value of the standard scheduling task table, to obtain one or more scheduling tables to be selected;

For example, the random standard scheduling task table set includes a first random standard task scheduling table with an optimization function value of 10, a second random standard task scheduling table with an optimization function value of 15, and a third random standard task with an optimization function value of 17. The scheduling table and the fourth random standard task scheduling table with the optimization function value of 19; when the optimization function value of the standard scheduling task table is 16, select the first random standard task scheduling table and the optimization function value with the optimization function value of 10 The second random standard task schedule table of 15 is the schedule table to be selected.

S8. From the multiple schedule tables to be selected, select one of the schedule tables to be selected as the task schedule table according to a preset rule.

In detail, the embodiment of the present application calculates the scores of the one or more to-be-selected schedules, and determines the to-be-selected schedule with the lowest score as the task schedule.

In the embodiment of the present application, the following scoring algorithm is used to calculate the score Grade _i of the scheduling table to be selected:

Grade _i = the delay time of the task with the highest priority × α + the delay time of the task with the non-highest priority × β

+ estimated execution time of the highest priority task × γ

+ estimated execution time of tasks with non-highest priority × δ

Among them, α, β, γ, δ are preset weight coefficients.

In the embodiment of the present application, the task scheduling table is selected as the task scheduling table with the lowest score. For example, the score of the first scheduling table to be selected among the multiple scheduling tables to be selected is 33, and the score of the second scheduling table to be selected is 66. Then, the first scheduling table to be selected is selected as the task scheduling table.

In this embodiment of the present application, in order to ensure the privacy of data, the task schedule may be stored in a blockchain node.

S9. Perform task scheduling according to the task scheduling table.

In the embodiment of the present application, the task is scheduled to the execution objects in the execution object set for execution according to the task scheduling table.

As shown in FIG. 3 , it is a functional block diagram of the task scheduling apparatus of the present application.

The task scheduling apparatus 100 described in this application may be installed in an electronic device. According to the realized functions, the task scheduling apparatus may include a schedule generation module 101, a schedule screening module 102, and a schedule scheduling module 103. The modules in the present invention may also be referred to as units, which refer to a device that can be used by electronic equipment. A series of computer program segments executed by a processor and capable of performing fixed functions and stored in the memory of an electronic device.

In this embodiment, the functions of each module/unit are as follows:

The scheduling table generating module 101 is configured to obtain a task set to be scheduled, sort the task set to be scheduled, and obtain a standard task set to be scheduled; schedule and assign tasks in the standard task set to be scheduled in order to obtain an initial task Scheduling table and unscheduled task set; perform insertion scheduling on all tasks in the unscheduled task set according to the initial scheduled task table to obtain a standard scheduled task table; randomly scramble the tasks in the standard to-be-scheduled task set for many times sequence to obtain a plurality of random task sets to be scheduled; assign tasks in the random task set to be scheduled in order to obtain a random initial task schedule and a random unscheduled task set; All tasks in the random unscheduled task set are inserted and scheduled to obtain a random standard scheduling task table, and all the random standard scheduling task tables are aggregated to obtain a random standard scheduling task table set; according to the standard scheduling task table, the random standard The scheduling task table set is filtered to obtain one or more scheduling tables to be selected.

Further, in order to save the scheduling and allocation time in the embodiment of the present application, it is necessary to sort all the tasks to be scheduled included in the task set to be scheduled first. All tasks to be scheduled in the set of tasks to be scheduled are sorted by the task priority corresponding to each task to be scheduled and the scheduled start time of the task to obtain the standard set of tasks to be scheduled.

In detail, the scheduling table generating module 101 in the embodiment of the present application performs all tasks to be scheduled in the set of tasks to be scheduled according to the task priority and planned start time of each task to be scheduled in the set of tasks to be scheduled. Sorting includes: sorting tasks to be scheduled in the set of tasks to be scheduled according to task priorities to obtain an initial set of tasks to be scheduled; Sorting is performed to obtain the standard task set to be scheduled.

In order to better schedule tasks, the scheduling table generation module 101 described in this embodiment of the present application extracts the execution objects in the executable object list corresponding to each to-be-scheduled task in the standard to-be-scheduled task set, and performs an analysis on the extracted execution objects. Perform summary and deduplication processing to obtain the execution object set.

Further, in order to make better use of the execution objects in the execution object set, it is necessary to know the task scheduling situation of each execution object. An execution object scheduling task set of an execution object, wherein the execution object scheduling task set is the task set that has been scheduled in the execution object, and each task in the execution object scheduling task set contains corresponding task scheduling information, including : Task scheduling start time, task expected execution time, task latest deadline, task scheduling execution object. In this embodiment of the present application, one execution object can only execute one task at the same time. Further, according to the execution object set and the execution object scheduling task set, the scheduling table generating module 101 according to the embodiment of the present application schedules and allocates tasks in the standard task set to be scheduled in order, and obtains the initial task scheduling table and the unscheduled tasks. Schedule a set of tasks.

In detail, the scheduling table generating module 101 described in the embodiment of the present application obtains the initial task scheduling table and the unscheduled task set by using the following means, including:

In one of the embodiments of the present application, if the number of tasks in the unscheduled task set is zero, it means that all tasks in the to-be-scheduled task set have been scheduled, and the scheduling table generating module 101 determines the initial scheduling task table as Standard schedule task table.

In another embodiment of the present application, if the number of tasks in the unscheduled task set is not zero, the scheduling table generation module 101 performs insertion scheduling on all tasks in the unscheduled task set according to the initial scheduled task table, Get a list of standard scheduled tasks.

In detail, in order to minimize the delay time of the execution object of the task scheduling in the unscheduled task set, in this embodiment of the present application, the schedule generation module 101 uses the following means to insert all tasks in the unscheduled task set: Scheduling, get the standard scheduling task table, including:

Among them, n is the total amount of scheduled tasks of the execution object, q is the scheduled tasks in the execution object, RealStartTime _q is the task scheduling start time, ExecutionTime _q is the expected execution time of the task, and EndTime _q is the latest deadline for the task.

Step g, choose the execution object with the minimum schedulable minimum delay time in the standard execution object list corresponding to the unscheduled task Task _q , insert the unscheduled task Task _q into the gap recorded in step e, and return to step a , until all the unscheduled task sets in the unscheduled task set have been traversed, and at this time, the task information of each task in the standard to-be-scheduled task set is counted to obtain a standard scheduled task table.

The standard scheduling task table may be locally optimal scheduling. In order to obtain the global optimal scheduling, the scheduling table generating module 101 in the embodiment of the present application randomly shuffles the tasks in the standard task set to be scheduled for many times to obtain multiple tasks. A random set of tasks to be scheduled.

In detail, the scheduling table generating module 101 in the embodiment of the present application randomly shuffles the tasks in the standard task set to be scheduled multiple times to obtain multiple random task sets to be scheduled, including: The centralized tasks are sorted multiple times according to a preset sorting rule set to obtain a plurality of the random task sets to be scheduled, wherein the sorting rules in the sorting rule set include: sorting by expected execution time of tasks, sorting by priority of tasks, and/or Task schedule start time sorting.

In this embodiment of the present application, the method for sequentially scheduling and assigning tasks in the random to-be-scheduled task set is the same as the above-mentioned method for sequentially scheduling and assigning tasks in the standard to-be-scheduled task set, and details are not repeated here.

Further, if the number of tasks in the random unscheduled task set is zero, it means that all tasks in the random to-be-scheduled task set have been scheduled, and the schedule generation module 101 determines the random initial task schedule as: Random standard task scheduling table; if the number of tasks in the random unscheduled task set is not zero, the scheduling table generating module 101 shuffles the tasks in the random initial unscheduled task set according to the preset sorting rules to obtain random unscheduled tasks A task set, performing insertion scheduling on all tasks in the random unscheduled task set according to the random initial task scheduling table to obtain a random standard task scheduling table.

Further, the method of performing insertion scheduling on all tasks in the random unscheduled task set according to the random initial scheduling task table in the embodiment of the present application is the same as the above-mentioned method for performing insertion scheduling on all tasks in the unscheduled task set. The method is the same, and will not be repeated here.

In addition, in the embodiment of the present application, the scheduling table generation module 101 uses the following means to filter the random standard scheduling task table set to obtain one or more scheduling tables to be selected, including:

Use the objective optimization function to calculate the optimization function value of each random standard scheduling task table set in the random standard scheduling task table set;

using the objective optimization function to calculate an optimization function value of the standard scheduled task table; and

Selecting a random standard scheduling task table whose optimization function value in the random standard scheduling task table is less than or equal to the optimization function value of the standard scheduling task table, to obtain one or more to-be-selected scheduling tables.

F=f ₁ +f ₂ +f ₃

f ₁ =Σ(StartTime _i +ExecutionTime _i -EndTime _i )

The scheduling table screening module 102 is configured to select one of the scheduling tables to be selected as the task scheduling table according to a preset rule from among the scheduling tables to be selected.

In detail, the schedule screening module 102 described in this embodiment of the present application calculates the score of the one or more schedules to be selected, and determines that the schedule to be selected with the lowest score is the task schedule.

In the embodiment of the present application, the scheduling table screening module 102 uses the following scoring algorithm to calculate the score Grade _i of the scheduling table to be selected:

+ estimated execution time of the highest priority task × γ

+ estimated execution time of tasks with non-highest priority × δ

Among them, α, β, γ, δ are preset weight coefficients.

The scheduling table scheduling module 103 is configured to perform task scheduling according to the task scheduling table.

In this embodiment of the present application, tasks are scheduled to execution objects in the execution object set for execution according to the task scheduling table.

As shown in FIG. 4 , it is a schematic structural diagram of an electronic device implementing the task scheduling method of the present application.

The electronic device 1 may include a processor 10, a memory 11 and a bus, and may also include a computer program, such as a task scheduler 12, stored in the memory 11 and executable on the processor 10.

Wherein, the memory 11 includes at least one type of readable storage medium, and the readable storage medium includes flash memory, mobile hard disk, multimedia card, card-type memory (for example: SD or DX memory, etc.), magnetic memory, magnetic disk, CD etc. The memory 11 may be an internal storage unit of the electronic device 1 in some embodiments, such as a mobile hard disk of the electronic device 1 . In other embodiments, the memory 11 may also be an external storage device of the electronic device 1, such as a pluggable mobile hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital) equipped on the electronic device 1. , SD) card, flash memory card (Flash Card), etc. Further, the memory 11 may also include both an internal storage unit of the electronic device 1 and an external storage device. The memory 11 can not only be used to store application software installed in the electronic device 1 and various types of data, such as the code of a task scheduler, etc., but also can be used to temporarily store data that has been output or will be output.

In some embodiments, the processor 10 may be composed of integrated circuits, for example, may be composed of a single packaged integrated circuit, or may be composed of multiple integrated circuits packaged with the same function or different functions, including one or more integrated circuits. Central Processing Unit (CPU), microprocessor, digital processing chip, graphics processor and combination of various control chips, etc. The processor 10 is the control core (Control Unit) of the electronic device, and uses various interfaces and lines to connect the various components of the entire electronic device, by running or executing programs or modules (such as tasks) stored in the memory 11. Scheduler, etc.), and call data stored in the memory 11 to execute various functions of the electronic device 1 and process data.

The bus may be a peripheral component interconnect (PCI for short) bus or an extended industry standard architecture (Extended industry standard architecture, EISA for short) bus or the like. The bus can be divided into address bus, data bus, control bus and so on. The bus is configured to implement connection communication between the memory 11 and at least one processor 10 and the like.

FIG. 4 only shows an electronic device with components. Those skilled in the art can understand that the structure shown in FIG. 4 does not constitute a limitation on the electronic device 1, and may include fewer or more components than those shown in the drawings. components, or a combination of certain components, or a different arrangement of components.

For example, although not shown, the electronic device 1 may also include a power supply (such as a battery) for powering the various components, preferably, the power supply may be logically connected to the at least one processor 10 through a power management device, so that the power management The device implements functions such as charge management, discharge management, and power consumption management. The power source may also include one or more DC or AC power sources, recharging devices, power failure detection circuits, power converters or inverters, power status indicators, and any other components. The electronic device 1 may further include various sensors, Bluetooth modules, Wi-Fi modules, etc., which will not be repeated here.

Further, the electronic device 1 may also include a network interface, optionally, the network interface may include a wired interface and/or a wireless interface (such as a WI-FI interface, a Bluetooth interface, etc.), which is usually used in the electronic device 1 Establish a communication connection with other electronic devices.

Optionally, the electronic device 1 may further include a user interface, and the user interface may be a display (Display), an input unit (eg, a keyboard (Keyboard)), optionally, the user interface may also be a standard wired interface or a wireless interface. Optionally, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode, organic light-emitting diode) touch device, and the like. The display may also be appropriately called a display screen or a display unit, which is used for displaying information processed in the electronic device 1 and for displaying a visualized user interface.

It should be understood that the embodiments are only used for illustration, and are not limited by this structure in the scope of the patent application.

The task scheduler 12 stored in the memory 11 in the electronic device 1 is a combination of multiple computer programs, and when running in the processor 10, it can realize:

Task scheduling is performed according to the task scheduling table.

Specifically, for the specific implementation method of the above-mentioned computer program by the processor 10, reference may be made to the description of the relevant steps in the corresponding embodiment of FIG. 1, and details are not described herein.

Further, if the modules/units integrated in the electronic device 1 are implemented in the form of software functional units and sold or used as independent products, they may be stored in a computer-readable storage medium. The computer-readable storage medium may be non-volatile or volatile. The computer-readable storage medium may include: any entity or device capable of carrying the computer program code, a recording medium, a U disk, a removable hard disk, a magnetic disk, an optical disk, a computer memory, a read-only memory (ROM, Read-Only Memory) ).

Further, a computer program is stored in the computer-readable storage medium, and when the computer program is executed by the processor, the following steps are implemented:

Task scheduling is performed according to the task scheduling table.

In the several embodiments provided in this application, it should be understood that the disclosed apparatus, apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are only illustrative. For example, the division of the modules is only a logical function division, and there may be other division manners in actual implementation.

The modules described as separate components may or may not be physically separated, and components shown as modules may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution in this embodiment.

In addition, each functional module in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above-mentioned integrated units can be implemented in the form of hardware, or can be implemented in the form of hardware plus software function modules.

It will be apparent to those skilled in the art that the present application is not limited to the details of the above-described exemplary embodiments, but that the present application can be implemented in other specific forms without departing from the spirit or essential characteristics of the present application.

Accordingly, the embodiments are to be regarded in all respects as illustrative and not restrictive, and the scope of the application is to be defined by the appended claims rather than the foregoing description, which is therefore intended to fall within the scope of the claims. All changes within the meaning and scope of the equivalents of , are included in this application. Any reference signs in the claims shall not be construed as limiting the involved claim.

The blockchain referred to in this application is a new application mode of computer technologies such as distributed data storage, point-to-point transmission, consensus mechanism, and encryption algorithm. Blockchain, essentially a decentralized database, is a series of data blocks associated with cryptographic methods. Each data block contains a batch of network transaction information to verify its Validity of information (anti-counterfeiting) and generation of the next block. The blockchain can include the underlying platform of the blockchain, the platform product service layer, and the application service layer.

Furthermore, it is clear that the word "comprising" does not exclude other units or steps and the singular does not exclude the plural. Several units or means recited in the system claims can also be realized by one unit or means by means of software or hardware. Second-class terms are used to denote names and do not denote any particular order.

Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present application rather than limitations. Although the present application has been described in detail with reference to the preferred embodiments, those of ordinary skill in the art should understand that the technical solutions of the present application can be Modifications or equivalent substitutions can be made without departing from the spirit and scope of the technical solutions of the present application.

Claims

A task scheduling method, wherein the method comprises:

Obtaining a task set to be scheduled, sorting the task set to be scheduled, and obtaining a standard task set to be scheduled;

Scheduling and assigning tasks in the standard to-be-scheduled task set in order to obtain an initial task schedule and an unscheduled task set;

Perform insertion scheduling on all tasks in the unscheduled task set according to the initial scheduled task table to obtain a standard scheduled task table;

Randomly shuffle the tasks in the standard task set to be scheduled for multiple times to obtain multiple random task sets to be scheduled;

Scheduling and assigning tasks in the random task set to be scheduled in order to obtain a random initial task schedule and a random unscheduled task set;

Performing insertion scheduling on all tasks in the random unscheduled task set according to the random initial scheduling task table, obtaining a random standard scheduling task table, summarizing all the random standard scheduling task tables, and obtaining a random standard scheduling task table set;

Screening the random standard scheduling task table set according to the standard scheduling task table to obtain one or more to-be-selected scheduling tables;

From the multiple schedule tables to be selected, select one of the schedule tables to be selected as the task schedule table according to a preset rule;

Task scheduling is performed according to the task scheduling table.
The task scheduling method according to claim 1, wherein the sorting of the to-be-scheduled task set to obtain a standard to-be-scheduled task set comprises:

All tasks to be scheduled in the set of tasks to be scheduled are sorted according to the task priority of each task to be scheduled in the set of tasks to be scheduled and the planned start time of the task to obtain the set of standard tasks to be scheduled.
The task scheduling method according to claim 2, wherein the random standard scheduling task table set is screened according to the standard scheduling task table to obtain one or more to-be-selected scheduling tables, comprising:

Use the objective optimization function to calculate the optimization function value of each random standard scheduling task table in the random standard scheduling task table set;

Calculate the optimization function value of the standard scheduling task table by using the objective optimization function;

Selecting a random standard scheduling task table whose optimization function value in the random standard scheduling task table is less than or equal to the optimization function value of the standard scheduling task table, to obtain one or more to-be-selected scheduling tables.
The task scheduling method according to claim 2, wherein the scheduling and assigning tasks in the standard task set to be scheduled in order to obtain an initial task scheduling table and an unscheduled task set, comprising:

Extracting execution objects in the executable object list corresponding to each task to be scheduled in the standard task set to be scheduled, and performing aggregation and deduplication processing on the extracted execution objects to obtain an execution object set;

obtaining the execution object scheduling task set of each execution object in the execution object set;

According to the execution object set and the execution object scheduling task set, the tasks in the standard to-be-scheduled task set are scheduled and allocated in sequence, and an initial task scheduling table and an unscheduled task set are obtained.
The task scheduling method according to claim 4, wherein the tasks in the standard to-be-scheduled task set are sequentially scheduled and allocated according to the execution object set and the execution object scheduling task set to obtain an initial task scheduling table and a Set of unscheduled tasks, including:

Task extracting step: extracting a task to be scheduled from the standard task set to be scheduled through a traversal operation;

The step of sorting execution objects: sorting the execution objects in the extracted executable object list of the to-be-scheduled task according to the execution object scheduling task set to obtain a first standard execution object list;

The step of extracting execution objects: extracting a standard execution object from the first standard execution object list through a traversal operation;

The task scheduling step: extracting the scheduling time of each task in the execution scheduling task set of the standard execution object, and judging whether the extracted scheduling time has a time conflict with the extracted planning scheduling time of the to-be-scheduled task; If there is no time conflict between the time and the extracted planned scheduling time of the to-be-scheduled task, the to-be-scheduled task is directly scheduled, the directly-scheduled to-be-scheduled task is added to the execution scheduling task set, and returned The task extraction step is performed until the task traversal in the standard to-be-scheduled task set is completed; if there is a time conflict between all the scheduling times and the planned scheduling time corresponding to the to-be-scheduled task, the to-be-scheduled task is determined to be unscheduled task, return to the execution object extraction step, until the task traversal in the standard task set to be scheduled is completed;

Scheduling statistics step: summarizing all execution object scheduling task sets to obtain an initial scheduled task table, and sorting and summarizing all the unscheduled tasks to obtain an unscheduled task set.
The task scheduling method according to claim 5, wherein the direct scheduling of the to-be-scheduled task comprises:

The planned scheduling time corresponding to the task to be scheduled is determined as the scheduling time, and the scheduling execution object is determined.
The task scheduling method according to any one of claims 1 to 6, wherein the random order of tasks in the standard to-be-scheduled task set is randomly shuffled multiple times to obtain a plurality of random to-be-scheduled task sets, including:

The tasks in the standard to-be-scheduled task set are sorted for multiple times according to a preset sorting rule set to obtain a plurality of the random to-be-scheduled task sets.
A task scheduling device, comprising:

The scheduling table generation module is used to obtain the task set to be scheduled, sort the task set to be scheduled, and obtain a standard task set to be scheduled; schedule and assign tasks in the standard task set to be scheduled in order to obtain an initial task scheduling table and unscheduled task set; perform insertion scheduling on all tasks in the unscheduled task set according to the initial scheduled task table, and obtain a standard scheduled task table; randomly shuffle the order of the tasks in the standard to-be-scheduled task set for many times, Obtain a plurality of random task sets to be scheduled; schedule and assign tasks in the random task set to be scheduled in order to obtain a random initial task schedule and a random unscheduled task set; All tasks in the scheduling task set are inserted and scheduled to obtain a random standard scheduling task table, and all the random standard scheduling task tables are aggregated to obtain a random standard scheduling task table set; the random standard scheduling task table is based on the standard scheduling task table. Filter the table set to obtain one or more scheduling tables to be selected;

The scheduling table screening module is used to select one of the scheduling tables to be selected as the task scheduling table according to a preset rule from the plurality of scheduling tables to be selected;

The scheduling table scheduling module is configured to perform task scheduling according to the task scheduling table.
An electronic device, wherein the electronic device comprises:

at least one processor; and,

a memory communicatively coupled to the at least one processor; wherein,

The memory stores computer program instructions executable by the at least one processor, the computer program instructions being executed by the at least one processor to enable the at least one processor to perform the steps of:

Obtaining a task set to be scheduled, sorting the task set to be scheduled, and obtaining a standard task set to be scheduled;

Scheduling and assigning tasks in the standard to-be-scheduled task set in order to obtain an initial task schedule and an unscheduled task set;

Perform insertion scheduling on all tasks in the unscheduled task set according to the initial scheduled task table to obtain a standard scheduled task table;

Randomly shuffle the tasks in the standard task set to be scheduled for multiple times to obtain multiple random task sets to be scheduled;

Scheduling and assigning tasks in the random task set to be scheduled in order to obtain a random initial task schedule and a random unscheduled task set;

Performing insertion scheduling on all tasks in the random unscheduled task set according to the random initial scheduling task table, obtaining a random standard scheduling task table, summarizing all the random standard scheduling task tables, and obtaining a random standard scheduling task table set;

Screen the random standard scheduling task table set according to the standard scheduling task table to obtain one or more scheduling tables to be selected;

From the multiple schedule tables to be selected, select one of the schedule tables to be selected as the task schedule table according to a preset rule;

Task scheduling is performed according to the task scheduling table.
The electronic device according to claim 9, wherein the sorting of the to-be-scheduled task set to obtain a standard to-be-scheduled task set comprises:

All tasks to be scheduled in the set of tasks to be scheduled are sorted according to the task priority of each task to be scheduled in the set of tasks to be scheduled and the planned start time of the task to obtain the set of standard tasks to be scheduled.
The electronic device according to claim 10, wherein the random standard scheduling task table set is filtered according to the standard scheduling task table to obtain one or more to-be-selected scheduling tables, comprising:

Use the objective optimization function to calculate the optimization function value of each random standard scheduling task table in the random standard scheduling task table set;

Calculate the optimization function value of the standard scheduling task table by using the objective optimization function;

Selecting a random standard scheduling task table whose optimization function value in the random standard scheduling task table is less than or equal to the optimization function value of the standard scheduling task table, to obtain one or more to-be-selected scheduling tables.
The electronic device according to claim 10, wherein the scheduling and assigning tasks in the standard task set to be scheduled in order to obtain an initial task scheduling table and an unscheduled task set, comprising:

Extracting execution objects in the executable object list corresponding to each task to be scheduled in the standard task set to be scheduled, and performing aggregation and deduplication processing on the extracted execution objects to obtain an execution object set;

obtaining the execution object scheduling task set of each execution object in the execution object set;

According to the execution object set and the execution object scheduling task set, the tasks in the standard to-be-scheduled task set are scheduled and allocated in sequence, and an initial task scheduling table and an unscheduled task set are obtained.
The electronic device according to claim 12, wherein the tasks in the standard to-be-scheduled task set are scheduled and allocated in sequence according to the execution object set and the execution object scheduling task set, to obtain an initial task schedule table and future tasks A set of scheduled tasks, including:

Task extracting step: extracting a task to be scheduled from the standard task set to be scheduled through a traversal operation;

The step of sorting execution objects: sorting the execution objects in the extracted executable object list of the to-be-scheduled task according to the execution object scheduling task set to obtain a first standard execution object list;

The step of extracting execution objects: extracting a standard execution object from the first standard execution object list through a traversal operation;

The task scheduling step: extracting the scheduling time of each task in the execution scheduling task set of the standard execution object, and judging whether the extracted scheduling time has a time conflict with the extracted planning scheduling time of the to-be-scheduled task; If there is no time conflict between the time and the extracted planned scheduling time of the to-be-scheduled task, the to-be-scheduled task is directly scheduled, the directly-scheduled to-be-scheduled task is added to the execution scheduling task set, and returned The task extraction step is performed until the task traversal in the standard to-be-scheduled task set is completed; if there is a time conflict between all the scheduling times and the planned scheduling time corresponding to the to-be-scheduled task, the to-be-scheduled task is determined to be unscheduled task, return to the execution object extraction step, until the task traversal in the standard task set to be scheduled is completed;

Scheduling statistics step: summarizing all execution object scheduling task sets to obtain an initial scheduled task table, and sorting and summarizing all the unscheduled tasks to obtain an unscheduled task set.
The electronic device according to claim 13, wherein the direct scheduling of the to-be-scheduled task comprises:

The planned scheduling time corresponding to the task to be scheduled is determined as the scheduling time, and the scheduling execution object is determined.
The electronic device according to any one of claims 9 to 14, wherein the tasks in the standard task set to be scheduled are randomly shuffled multiple times to obtain a plurality of random task sets to be scheduled, including:

The tasks in the standard to-be-scheduled task set are sorted for multiple times according to a preset sorting rule set to obtain a plurality of the random to-be-scheduled task sets.
A computer-readable storage medium storing a computer program, wherein the computer program implements the following steps when executed by a processor:

Obtaining a task set to be scheduled, sorting the task set to be scheduled, and obtaining a standard task set to be scheduled;

Scheduling and assigning tasks in the standard to-be-scheduled task set in order to obtain an initial task schedule and an unscheduled task set;

Perform insertion scheduling on all tasks in the unscheduled task set according to the initial scheduled task table to obtain a standard scheduled task table;

Randomly shuffle the tasks in the standard task set to be scheduled for multiple times to obtain multiple random task sets to be scheduled;

Scheduling and assigning tasks in the random task set to be scheduled in order to obtain a random initial task schedule and a random unscheduled task set;

Performing insertion scheduling on all tasks in the random unscheduled task set according to the random initial scheduling task table, obtaining a random standard scheduling task table, summarizing all the random standard scheduling task tables, and obtaining a random standard scheduling task table set;

Screening the random standard scheduling task table set according to the standard scheduling task table to obtain one or more to-be-selected scheduling tables;

From the multiple schedule tables to be selected, select one of the schedule tables to be selected as the task schedule table according to a preset rule;

Task scheduling is performed according to the task scheduling table.
The computer-readable storage medium according to claim 16, wherein the sorting of the task set to be scheduled to obtain a standard task set to be scheduled comprises:

All tasks to be scheduled in the set of tasks to be scheduled are sorted according to the task priority of each task to be scheduled in the set of tasks to be scheduled and the planned start time of the task to obtain the set of standard tasks to be scheduled.
The computer-readable storage medium according to claim 17, wherein the random standard scheduling task table set is filtered according to the standard scheduling task table to obtain one or more scheduling tables to be selected, comprising:

Use the objective optimization function to calculate the optimization function value of each random standard scheduling task table in the random standard scheduling task table set;

Using the objective optimization function to calculate the optimization function value of the standard scheduling task table;

Selecting a random standard scheduling task table whose optimization function value in the random standard scheduling task table is less than or equal to the optimization function value of the standard scheduling task table, to obtain one or more to-be-selected scheduling tables.
The computer-readable storage medium according to claim 17, wherein the scheduling and assigning tasks in the standard task set to be scheduled in order to obtain an initial task scheduling table and an unscheduled task set, comprising:

Extracting the execution objects in the executable object list corresponding to each to-be-scheduled task in the standard to-be-scheduled task set, and performing aggregation and deduplication processing on the extracted execution objects to obtain an execution object set;

Obtain the execution object scheduling task set of each execution object in the execution object set;

According to the execution object set and the execution object scheduling task set, the tasks in the standard to-be-scheduled task set are scheduled and allocated in sequence, and an initial task scheduling table and an unscheduled task set are obtained.
The computer-readable storage medium according to claim 19, wherein the tasks in the standard to-be-scheduled task set are sequentially scheduled and allocated according to the execution object set and the execution object scheduling task set to obtain an initial task schedule Table and set of unscheduled tasks, including:

The task extraction step: extracting a task to be scheduled from the standard task set to be scheduled through a traversal operation;

The step of sorting execution objects: sorting the execution objects in the extracted executable object list of the to-be-scheduled task according to the execution object scheduling task set to obtain a first standard execution object list;

The execution object extraction step: extracting a standard execution object from the first standard execution object list through a traversal operation;

The task scheduling step: extracting the scheduling time of each task in the execution scheduling task set of the standard execution object, and judging whether the extracted scheduling time has a time conflict with the extracted planned scheduling time of the to-be-scheduled task; If there is no time conflict between the time and the extracted planned scheduling time of the to-be-scheduled task, the to-be-scheduled task is directly scheduled, the directly-scheduled to-be-scheduled task is added to the execution scheduling task set, and returned The task extraction step is performed until the task traversal in the standard to-be-scheduled task set is completed; if there is a time conflict between all the scheduling times and the planned scheduling time corresponding to the to-be-scheduled task, the to-be-scheduled task is determined to be unscheduled task, returning to the execution object extraction step, until the task traversal in the standard task set to be scheduled is completed;

Scheduling statistics step: summarizing all execution object scheduling task sets to obtain an initial scheduled task table, and sorting and summarizing all the unscheduled tasks to obtain an unscheduled task set.