A Multi-task Scheduling Method with Multiple Competing Agents
A scheduling method and multi-task technology, applied in multi-programming devices, electrical digital data processing, program startup/switching, etc., can solve problems that cannot be effectively solved, do not involve solving multi-tasks, only consider a single agent and a single objective function, etc. problem, to achieve the effect of short life cycle and high satisfaction
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0045] A multi-task scheduling approach with multiple competing agents, such as figure 1 As shown, the method includes the following steps:
[0046] Step S1, set up m agents, and agent i has a set of jobs Among them, 1≤i≤m; these jobs will be processed on the machine as agent i-jobs; both machines and jobs are available at zero time, and the machine can process at most one job at a time; among m agents, agent 1 is High-priority long-term critical agents, while other agents are short-term one-off agents, each agent has its own objective function to optimize that depends only on its own job completion time.
[0047] In this embodiment, for each job J j (i) , 1≤i≤m, 1≤j≤n i , each has a processing time p j (i) ; For a given job schedule, define C j (i) , 1≤i≤m, 1≤j≤n i , indicating that job J j (i) completion time. For ease of understanding, the following parameters are defined in this embodiment:
[0048]
[0049]
[0050]
[0051]
[0052]
[0053] ...
Embodiment 2
[0076] Based on the multi-task scheduling method with multiple competing agents proposed in the above-mentioned embodiment 1, this embodiment is aimed at multi-agent multi-task scheduling when the objective function is the maximum value of the conventional scheduling function, specifically including:
[0077] Step S21, constructing the question: 2≤i≤m;
[0078] Step S22, using an inverse polynomial time solving algorithm to solve the above problem.
[0079] Step S221, define
[0080]
[0081] Indicates the time interval occupied by scheduled jobs, where,
[0082]
[0083] US indicates that no homework is scheduled;
[0084] Step S222, perform reverse iteration: in each iterative step, select a job among the unscheduled jobs and insert it into the current sequence for processing, if J \1 If there is an assignment with the largest deadline in , then the assignment should be selected; otherwise, it should be selected such that f j (1) (t) smallest unscheduled job If ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


