CN117973734A

CN117973734A - Task scheduling method and device

Info

Publication number: CN117973734A
Application number: CN202311654888.6A
Authority: CN
Inventors: 汪敏; 陈智超; 陶朝杰; 刘奎; 吴春龙; 韩子熹; 沈励钥; 徐晶
Original assignee: Shangfei Intelligent Technology Co ltd
Current assignee: Shangfei Intelligent Technology Co ltd
Priority date: 2023-12-04
Filing date: 2023-12-04
Publication date: 2024-05-03

Abstract

The invention provides a task orchestration method and device, wherein the method comprises the following steps: acquiring a generated scheduling scheme, and intercepting at least one task set in a target time period in the scheduling scheme, wherein the task set comprises a plurality of tasks with front-back relation, and each task has the emergency degree of a corresponding time dimension and the importance degree of a value dimension; quantifying the emergency degree of the time dimension and the importance degree of the value dimension corresponding to each task respectively to obtain a quantified emergency degree value and a quantified importance degree value; calculating according to a predefined priority curve, and a quantized emergency degree value and a quantized importance degree value of each task, and determining the priority of each task; and carrying out forced constraint according to the front-rear relation of the tasks, and carrying out scheduling according to the priorities of the tasks to obtain scheduling results, so that timeliness and strain of the plan are improved.

Description

Task scheduling method and device

Technical Field

The present invention relates to the field of computer technologies, and in particular, to a task scheduling method and apparatus.

Background

Task orchestration refers to the configuration, management, and coordination of all tasks that complete an item correspondence. In discrete manufacturing enterprises, the production products have the characteristics of multiple types and small batches, so that the production organization is complex in work, the task arrangement is often carried out by subjective experience, the timeliness and the strain of the plan are poor, and the problems of prolonged production period, low equipment personnel utilization efficiency and the like are caused.

In the prior art, a lot of researches on workshop production technology with high efficiency, high flexibility and high reliability are performed, for example, tasks are scheduled by a rule-based method, a system simulation method, a sequencing-based method and the like. Although the method can realize task arrangement, the method has poor strain and timeliness, and when the method is applied to actual production, the production rhythm is often disturbed due to a certain emergency, so that the arrangement result is not expected.

Disclosure of Invention

The invention provides a task arrangement method and device, which are used for solving the defects of poor task arrangement strain and timeliness in the prior art.

The invention provides a task orchestration method, which is used for a task orchestration system, and comprises the following steps:

Acquiring a generated scheduling scheme, and intercepting at least one task set in a target time period in the scheduling scheme, wherein the task set comprises a plurality of tasks with front-back relation, and each task has the emergency degree of a corresponding time dimension and the importance degree of a value dimension;

Quantifying the emergency degree of the time dimension and the importance degree of the value dimension corresponding to each task respectively to obtain a quantified emergency degree value and a quantified importance degree value;

Calculating according to a predefined priority curve, and a quantized emergency degree value and a quantized importance degree value of each task, and determining the priority of each task;

And scheduling according to the front-back relation of the tasks and the priorities of the tasks, and determining the scheduling result of the tasks.

According to the task arrangement method provided by the invention, the emergency degree of the time dimension corresponding to each task is quantized to obtain a quantized emergency degree value, and the method comprises the following steps:

Determining a distance delivery deadline corresponding to each task, wherein the distance delivery deadline characterizes the emergency degree of a time dimension, and the shorter the distance delivery deadline is, the larger the corresponding quantized emergency degree value is;

And quantifying according to the distance delivery deadline time corresponding to each task to obtain a quantified emergency degree value.

According to the task arrangement method provided by the invention, the importance degree of the value dimension corresponding to each task is quantized to obtain a quantized importance degree value, and the method comprises the following steps:

Weighting indexes of the value dimension of each task respectively; wherein the index of the value dimension comprises: the product value corresponding to the task, the number of tasks affected by the post-placement of the current task and the error rate of historical characters;

And carrying out normalization processing according to the index of the value dimension corresponding to each task and the weight thereof to obtain a corresponding quantized importance degree value.

According to the task arrangement method provided by the invention, the priority of each task is determined by calculating according to a predefined priority curve, and the quantized emergency degree value and the quantized importance degree value of each task, and the method comprises the following steps: normalizing the quantized emergency degree value and the quantized importance degree value of each task to obtain two-dimensional priority coordinates of each task; and obtaining the priority of each task according to a predefined priority curve and the two-dimensional priority coordinates of each task.

According to the task scheduling method provided by the invention, the priority of each task is obtained according to a predefined priority curve and the two-dimensional priority coordinates of each task, and the task scheduling method comprises the following steps: and determining the linear distance from the two-dimensional priority coordinates of each task to the priority curve according to a predefined priority curve and the two-dimensional priority coordinates of each task, and determining the linear distance as the priority of each task.

According to the task scheduling method provided by the invention, scheduling is performed according to the front-to-back relation of a plurality of tasks and the priority of the tasks, and the task scheduling result is determined, which comprises the following steps:

sequencing a plurality of tasks in each task set according to a front-back relation;

And repeatedly executing the steps of comparing the priority of the first non-scheduled tasks in each task set, and taking the non-scheduled task with the highest priority as the task to be scheduled until all the non-scheduled tasks are completely scheduled, thereby obtaining a scheduling result.

The invention also provides a task orchestration device for a task orchestration system, the device comprising:

The task set determining module is used for acquiring a generated scheduling scheme, and intercepting at least one task set in a target time period in the scheduling scheme, wherein the task set comprises a plurality of tasks with front-back relation, and each task has the emergency degree of a corresponding time dimension and the importance degree of a value dimension;

the quantization result determining module is used for respectively quantizing the emergency degree of the time dimension and the importance degree of the value dimension corresponding to each task to obtain a quantized emergency degree value and a quantized importance degree value;

the priority determining module is used for calculating according to a predefined priority curve, and the quantized emergency degree value and the quantized importance degree value of each task, and determining the priority of each task;

and the scheduling result determining module is used for scheduling according to the front-back relation of the tasks and the priorities of the tasks, and determining the scheduling result of the tasks.

According to the task orchestration device provided by the invention, the quantification result determining module is specifically configured to: determining a distance delivery deadline corresponding to each task, wherein the distance delivery deadline characterizes the emergency degree of a time dimension, and the shorter the distance delivery deadline is, the larger the corresponding quantized emergency degree value is; and quantifying according to the distance delivery deadline time corresponding to each task to obtain a quantified emergency degree value.

The invention also provides an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the task orchestration method according to any one of the preceding claims when the program is executed.

The present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the task orchestration method according to any one of the preceding claims.

The invention also provides a computer program product comprising a computer program which, when executed by a processor, implements the steps of a task orchestration method according to any one of the preceding claims.

According to the task scheduling method and device, the defect of overall scheduling in the aspect of flexibility is overcome by intercepting the task set of the target time period in the scheduling scheme, the priority of each task is determined according to the quantized emergency degree value and the quantized importance degree value of each task, forced constraint is carried out according to the front-rear relation of a plurality of tasks, scheduling is carried out according to the priority of the tasks, and scheduling results are obtained, so that timeliness and strain of a plan are improved.

Drawings

In order to more clearly illustrate the invention or the technical solutions of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.

FIG. 1 is a schematic flow chart of a task orchestration method according to the present invention;

FIG. 2 is a schematic diagram of a coordinate system established according to importance level values and emergency level values provided by the present invention;

FIG. 3 is a second flow chart of the task orchestration method according to the present invention;

FIG. 4 is a third flow chart of the task orchestration method according to the present invention;

FIG. 5 is a flow chart of a task orchestration method according to the present invention;

FIG. 6 is a schematic diagram of the present invention for obtaining priority for each task;

FIG. 7 is a flow chart of a task orchestration method according to the present invention;

FIG. 8 is a schematic diagram of an arrangement of a plurality of tasks provided by the present invention;

FIG. 9 is a flowchart of a task orchestration method according to the present invention;

FIG. 10 is a schematic diagram of a task orchestration device according to the present invention;

fig. 11 is a schematic structural diagram of an electronic device provided by the present invention.

Detailed Description

For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.

The task orchestration method and apparatus of the present invention are described below in connection with FIGS. 1-10.

The invention discloses a task orchestration method, which is used for a task orchestration system, and referring to FIG. 1, the method comprises the following steps:

101. And acquiring the generated scheduling scheme, and intercepting at least one task set in a target time period in the scheduling scheme, wherein the task set comprises a plurality of tasks with front-back relation, and each task has the emergency degree of a corresponding time dimension and the importance degree of a value dimension.

The generated scheduling scheme is an initial scheme which can perform scheduling according to subjective experience or production and processing procedures in a discrete manufacturing enterprise. The production scheduling scheme is more based on the overall step consideration of production and processing, and has poor timeliness and strain, which can lead to problems of prolonged production period, low utilization efficiency of equipment personnel and the like.

In this embodiment, a plurality of task sets within a target time period may be intercepted in the scheduling scheme, for example, a plurality of task sets of 4 hours a.m. may be intercepted, and rearranged by the task arranging method of this embodiment.

The tasks contained in each task set are related tasks, for example, the task set can be a task set of surface machining, assembly, debugging and the like, wherein the surface machining task set can comprise a turning task, a milling task, a drilling task and the like. The tasks have a front-back relation, for example, for the surface machining task set, the tasks are ordered according to the machining sequence of turning, milling and drilling.

Each task has a corresponding degree of urgency in the time dimension and importance in the value dimension. In this embodiment, the urgency degree of the time dimension and the importance degree of the value dimension of each task are considered and used for determining the priority in the subsequent step, so that the task priority can truly reflect the scheduling requirement in actual production.

102. And quantifying the emergency degree of the time dimension and the importance degree of the value dimension corresponding to each task to obtain a quantified emergency degree value and a quantified importance degree value.

In particular, the urgency of a task is related to the deadline, i.e. the closer to the deadline, the higher the value of the urgency; the importance of a task is related to the value of the task itself, i.e., the higher the task value, the higher the index value. The high urgency and high value tasks naturally have the highest priority, but the high urgency, low value and low urgency and high value priorities still need to be further compared, and the simplest and intuitive mode is to quantify the urgency and the importance to corresponding values respectively and then order the tasks.

Referring to fig. 2, fig. 2 shows a schematic diagram for establishing a coordinate system according to importance values and urgency values. As can be seen from fig. 2, the urgency level of the time dimension is taken as the horizontal axis, the importance level of the value dimension is taken as the vertical axis, and the whole coordinate system is divided into four parts of urgency, importance, nonemergency and urgency, and importance, and each task can be correspondingly marked in the coordinate system according to the quantized urgency level value and the quantized importance level value corresponding to each task.

103. And calculating according to a predefined priority curve, and the quantized emergency degree value and the quantized importance degree value of each task, and determining the priority of each task.

Wherein the priority curve may be predefined based on experience of use, e.g. defining the priority curve as y=kx.

In a specific calculation method, specifically, a quantized urgency value and a quantized importance value of each task may be calculated as coordinate points, and then the shortest distance between the coordinate points and a priority curve is calculated, and the determined value is used as the priority of the task.

104. And scheduling according to the front-back relation of the tasks and the priorities of the tasks, and determining the scheduling result of the tasks.

In the case of task priority determination, the final scheduling result is also determined by comprehensively considering the front-to-back relation and priorities of a plurality of tasks.

For example, for a plurality of tasks in a single task set, the front-back relationship is task a-task B-task C, the priority of task a is 0.5, the priority of task B is 0.6, and the priority of task C is 0.8, then the final scheduling sequence is still task a-task B-task C.

For a plurality of tasks in a plurality of task sets, such as task set 1 and task set 2, the task set includes task 11-task 12-task 13, the priority of task 11 is 0.7, the priority of task 12 is 0.5, and the priority of task 13 is 0.6; the task set 2 includes tasks 21-22-23, the priority of the task 21 is 0.8, the priority of the task 22 is 0.75, and the priority of the task 23 is 0.4, so that the front-back relation of a plurality of tasks in two task sets and the priority of the tasks need to be compared, and finally, the checking result is determined to be the task 21-22-task 11-task 12-task 13-task 23.

According to the task scheduling method provided by the invention, the defect of overall scheduling in the aspect of flexibility is overcome by intercepting the task set of the target time period in the scheduling scheme, then the priority of each task is determined according to the quantized emergency degree value and the quantized importance degree value of each task, forced constraint is carried out according to the front-rear relation of a plurality of tasks, and scheduling is carried out according to the priority of the tasks to obtain the scheduling result, so that the timeliness and the strain of the plan are improved.

The method has the advantages that the method can combine the existing excellent workshop scheduling technology to perform secondary scheduling on the scheduling tasks in a short period, so that the scheduling result is more suitable for complex production sites of discrete workshops, and the overall performance and flexibility of scheduling are considered.

Further, referring to fig. 3, quantifying the urgency of the time dimension corresponding to each task in step 102, to obtain a quantified urgency value includes:

301. And determining the distance delivery deadline time corresponding to each task, wherein the distance delivery deadline time represents the emergency degree of the time dimension, and the shorter the distance delivery deadline time is, the larger the corresponding quantized emergency degree value is.

302. And quantifying according to the distance delivery deadline time corresponding to each task to obtain a quantified emergency degree value.

Specifically, given that the rated time of the i-th task is T _i, the expiration date D _i, and the current date D _cur, the rated time is long, meaning that it is more likely that it is impossible to finish on schedule, the corresponding quantized urgency value P _i is calculated by the following formula (1):

Through the formula (1), the quantized emergency value obtained after the distance delivery deadline time of each task is quantized can be realized.

Wherein for each task's rated time and expiration date, it should be possible to collect before calculating the quantified urgency value.

Further, referring to fig. 4, quantifying the importance of the value dimension corresponding to each task in step 102, to obtain a quantified importance value includes:

401. weighting indexes of the value dimension of each task respectively; wherein the index of the value dimension comprises: the product value corresponding to the task, the number of tasks affected by the post-placement of the current task and the error rate of the historical task.

402. And carrying out normalization processing according to the index of the value dimension corresponding to each task and the weight thereof to obtain a corresponding quantized importance degree value.

In particular, the values of the various tasks of the production of the product are not equivalent, and the value of the task, namely the quantitative importance value E _i, is to be described, considering the following elements: the product value x _i1 corresponding to the task, the post-impact task number x _i2 of the current task and the error rate x _i3 of the historical task are normalized, and then weighted and summed, corresponding to the following formula (2):

E_i＝ω₁ x_i1+ω₂ x_i2+ω₃ x_i3 (2)

Wherein ω ₁ is a weight corresponding to a product value corresponding to a task, ω ₂ is a weight corresponding to a post-impact task number of a current task, and ω ₃ is a weight corresponding to a failure rate of a history task.

Further, referring to fig. 5, step 103 includes:

501. and carrying out normalization processing on the quantized emergency degree value and the quantized importance degree value of each task to obtain the two-dimensional priority coordinates of each task.

Wherein, the quantized emergency degree value and the quantized importance degree value after normalization processing are both in the range of [0,1], which is convenient for subsequent calculation, as shown in fig. 6.

502. And obtaining the priority of each task according to a predefined priority curve and the two-dimensional priority coordinates of each task.

Specifically, referring to fig. 6, according to a predefined priority curve y=kx and the two-dimensional priority coordinates of each task, a straight line distance from the two-dimensional priority coordinates of each task to the priority curve is determined, and the straight line distance is determined as the priority of each task.

Regarding the priority curve, a balance coefficient k needs to be defined, and then the curve is y=kx. When the balance coefficient is 0, only the importance level is considered; the equilibrium coefficient is ≡and only the degree of emergency is considered. Priority calculation formula, distance formula (3):

Wherein E _i and P _i are the quantized importance value and the quantized urgency value of the ith task, respectively; d _i is the priority of the ith task.

Through the steps 501-502, the priority corresponding to each task can be determined, and a basis is provided for the subsequent task arrangement steps.

Further, referring to fig. 7, step 104 includes:

701. and sequencing the plurality of tasks in each task set according to the front-back relation.

In this embodiment, since there is a constraint of the front-back relationship, there may be a case where the front-back task priority is low and the back-back task priority is high. Therefore, in this embodiment, a set of tasks to be scheduled needs to be defined, and the tasks with highest priority and not scheduled are compared and selected as tasks to be scheduled, so as to finally obtain a scheduling result.

702. And repeatedly executing the steps of comparing the priority of the first non-scheduled tasks in each task set, and taking the non-scheduled task with the highest priority as the task to be scheduled until all the non-scheduled tasks are completely scheduled, thereby obtaining a scheduling result.

For example, 9 tasks in fig. 8, with priorities for each task in brackets. The method comprises 3 task sets A, B, C, wherein a task set A comprises tasks A1, A2 and A3, a task set B comprises tasks B1 and B2, and a task set C comprises tasks C1, C2 and C3. Firstly taking 3 tasks A1, B1 and C1 without front arrangement as a set of tasks to be scheduled, wherein the task C1 has the highest priority, and taking the task C1 without scheduled production with the highest priority as the task to be scheduled; then the set of the tasks to be scheduled is changed into A1, B1 and C2, wherein the priority of the task C2 which is not scheduled is highest, and the task C2 which is not scheduled is used as the next task to be scheduled; then the set of the tasks to be scheduled becomes A1, B1 and C3, wherein the priority values of A1 and C3 are the same, and one of the tasks to be scheduled is randomly selected as a task to be scheduled, such as task A1; the set of tasks to be scheduled then becomes A2, B1, C3..

In order to facilitate understanding of the technical scheme of the method, the task orchestration method is further schematically described in this embodiment.

Referring to fig. 9, fig. 9 illustrates a task orchestration method according to the present invention, comprising:

901. And acquiring the generated scheduling scheme, and intercepting at least one task set in a target time period in the scheduling scheme.

Each task set comprises a plurality of tasks with front-to-back relationships, and at least one task set comprises n tasks. Wherein n is an integer greater than 1.

Table 1 shows a task information table in the present embodiment.

TABLE 1

Numbering device	Rated time	Expiration date	Product value	Historical error rate	Influencing the amount of tasks
						1	4	2023-03-18	5	2％	4
2	4	2023-03-17	7	3％	5
						3	6	2023-03-18	10	1％	3
4	8	2023-03-19	3	5％	0
						5	3	2023-03-17	8	9％	2

902. And determining the distance delivery deadline time corresponding to the n tasks, and quantifying according to the distance delivery deadline time corresponding to each task to obtain a quantified urgency value P _i＝T_i/(D_i-D_cur, wherein T _i is the rated time of the ith task, D _i is the expiration date, and D _cur is the current date.

903. Weights omega ₁、ω₂ and omega ₃ are respectively assigned to the product value x _i1 corresponding to the n tasks, the number x _i2 of the post-impact tasks of the current task and the error rate x _i3 of the historical tasks, and then normalization processing is carried out to obtain a corresponding quantized importance value E _i＝ω₁x_i1+ω₂x_i2+ω₃x_i3.

And respectively assigning weights of the product value, the error rate of the historical tasks and the number of the post-influencing tasks of the current task to be 0.5, 0.3 and 0.2.

Referring to table 2, table 2 shows the quantized importance level value and the quantized urgency level value of each task.

TABLE 2

Numbering device	Degree of emergency	Importance level
			1	0.083	0.34
2	0.167	0.561
			3	0.125	0.62
4	0.111	0.15
			5	0.125	0.737

904. And normalizing the quantized emergency degree value P _i and the quantized importance degree value E _i of each task to obtain two-dimensional priority coordinates (E _i,P_i) of each task.

905. The priority curve parameter k is customized.

906. Calculating the distance d _i between the two-dimensional priority coordinate point of each task and the curve y=kx, determining the linear distance between the two-dimensional priority coordinate of each task and the priority curve, and determining the linear distance as the priority d ₁,d₂, … and dn of each task.

In this embodiment, the finally determined priorities are shown in table 3.

TABLE 3 Table 3

907. And sequencing the plurality of tasks in each task set according to the front-back relation.

908. And repeatedly executing the steps of comparing the priority of the first non-scheduled tasks in each task set, and taking the non-scheduled task with the highest priority as the task to be scheduled until all the non-scheduled tasks are completely scheduled, thereby obtaining a scheduling result.

Through the steps 901-908, the method of the embodiment realizes the task arrangement in a shorter period based on the whole production result, and overcomes the defect of the whole production in the aspect of flexibility, especially in the discrete industry. In addition, the method of the embodiment defines a new method for quantifying task priority, the priority is corresponding to a plane coordinate system, and the priority degree of the task is intuitively displayed through the distance from a coordinate point to a curve by combining a self-defined priority curve.

The task orchestration device provided by the present invention will be described below, and the task orchestration device described below and the task orchestration method described above may be referred to correspondingly to each other.

The invention discloses a task orchestration device, see fig. 10, for a task orchestration system, the device comprising:

A task set determining module 1001, configured to obtain a generated scheduling scheme, and intercept at least one task set in a target time period in the scheduling scheme, where the task set includes a plurality of tasks with a front-to-back relationship, each task has a corresponding urgency level of a time dimension and an importance level of a value dimension;

the quantization result determining module 1002 is configured to quantize the urgency level of the time dimension and the importance level of the value dimension corresponding to each task, to obtain a quantized urgency level value and a quantized importance level value;

A priority determining module 1003, configured to calculate, according to a predefined priority curve, and a quantized urgency value and a quantized importance value of each task, and determine a priority of each task;

And the scheduling result determining module 1004 is configured to determine a scheduling result of the task according to the front-to-back relationships of the tasks and priorities of the tasks.

Optionally, the quantization result determining module 1002 is specifically configured to:

Optionally, the priority determining module 1003 is specifically configured to:

normalizing the quantized emergency degree value and the quantized importance degree value of each task to obtain two-dimensional priority coordinates of each task;

And obtaining the priority of each task according to a predefined priority curve and the two-dimensional priority coordinates of each task.

Optionally, the priority determining module 1003 is specifically configured to:

And determining the linear distance from the two-dimensional priority coordinates of each task to the priority curve according to a predefined priority curve and the two-dimensional priority coordinates of each task, and determining the linear distance as the priority of each task.

Optionally, the scheduling result determining module 1004 is specifically configured to:

According to the task scheduling device provided by the invention, the defect of overall scheduling in the aspect of flexibility is overcome by intercepting the task set of the target time period in the scheduling scheme, then the priority of each task is determined according to the quantized emergency degree value and the quantized importance degree value of each task, forced constraint is carried out according to the front-rear relation of a plurality of tasks, and scheduling is carried out according to the priority of the tasks to obtain the scheduling result, so that the timeliness and the strain of a plan are improved.

Fig. 11 illustrates a physical structure diagram of an electronic device, as shown in fig. 11, which may include: processor 1110, communication interface Communications Interface 1120, memory 1130, and communication bus 1140, wherein processor 1110, communication interface 1120, memory 1130 perform communication with each other through communication bus 1140. Processor 1110 may call logic instructions in memory 1130 to perform a tasking method comprising: acquiring a generated scheduling scheme, and intercepting at least one task set in a target time period in the scheduling scheme, wherein the task set comprises a plurality of tasks with front-back relation, and each task has the emergency degree of a corresponding time dimension and the importance degree of a value dimension; quantifying the emergency degree of the time dimension and the importance degree of the value dimension corresponding to each task respectively to obtain a quantified emergency degree value and a quantified importance degree value; calculating according to a predefined priority curve, and a quantized emergency degree value and a quantized importance degree value of each task, and determining the priority of each task; and scheduling according to the front-back relation of the tasks and the priorities of the tasks, and determining the scheduling result of the tasks.

Further, the logic instructions in the memory 1130 described above may be implemented in the form of software functional units and sold or used as a stand-alone product, stored on a computer-readable storage medium. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a usb disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

In another aspect, the present invention also provides a computer program product, the computer program product comprising a computer program, the computer program being storable on a non-transitory computer readable storage medium, the computer program, when executed by a processor, being capable of performing the task orchestration method provided by the methods described above, comprising: acquiring a generated scheduling scheme, and intercepting at least one task set in a target time period in the scheduling scheme, wherein the task set comprises a plurality of tasks with front-back relation, and each task has the emergency degree of a corresponding time dimension and the importance degree of a value dimension; quantifying the emergency degree of the time dimension and the importance degree of the value dimension corresponding to each task respectively to obtain a quantified emergency degree value and a quantified importance degree value; calculating according to a predefined priority curve, and a quantized emergency degree value and a quantized importance degree value of each task, and determining the priority of each task; and scheduling according to the front-back relation of the tasks and the priorities of the tasks, and determining the scheduling result of the tasks.

In yet another aspect, the present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform the task orchestration method provided by the above methods, comprising: acquiring a generated scheduling scheme, and intercepting at least one task set in a target time period in the scheduling scheme, wherein the task set comprises a plurality of tasks with front-back relation, and each task has the emergency degree of a corresponding time dimension and the importance degree of a value dimension; quantifying the emergency degree of the time dimension and the importance degree of the value dimension corresponding to each task respectively to obtain a quantified emergency degree value and a quantified importance degree value; calculating according to a predefined priority curve, and a quantized emergency degree value and a quantized importance degree value of each task, and determining the priority of each task; and scheduling according to the front-back relation of the tasks and the priorities of the tasks, and determining the scheduling result of the tasks.

The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.

From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.

Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method of task orchestration for a task orchestration system, the method comprising:

2. The task orchestration method according to claim 1, wherein quantifying the urgency of the time dimension corresponding to each task, obtaining a quantified urgency value, comprises:

3. The task orchestration method according to claim 1, wherein quantifying the importance of the value dimension corresponding to each task, obtaining a quantified importance value, comprises:

4. The task orchestration method according to claim 1, wherein,

Calculating according to a predefined priority curve, and a quantized urgency value and a quantized importance value of each task, and determining the priority of each task, wherein the method comprises the following steps:

5. The task orchestration method according to claim 4, wherein deriving the priority of each of the tasks from a predefined priority curve and two-dimensional priority coordinates of each of the tasks, comprises:

6. The task orchestration method according to claim 1, wherein scheduling according to a front-to-back relation of a plurality of tasks and priorities of the tasks, determining a scheduling result of the tasks, comprises:

7. A task orchestration device for a task orchestration system, the device comprising:

8. The task orchestration device according to claim 7, wherein the quantification result determination module is specifically configured to:

9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the task orchestration method according to any one of claims 1-6 when the program is executed.

10. A non-transitory computer readable storage medium having stored thereon a computer program, which when executed by a processor performs the steps of the task orchestration method according to any one of claims 1 to 6.