Unlock instant, AI-driven research and patent intelligence for your innovation.

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

Active Publication Date: 2020-05-19
UNIV OF ELECTRONICS SCI & TECH OF CHINA +1
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Extensive research has been done on a variety of multi-agent scheduling models with various constraints and performance criteria from different production environments; that is, the prior art studies the scheduling problem of multi-agents, but does not address the problem of solving multi-tasking; Moreover, the existing multi-task scheduling problems only consider the case of a single agent and a single objective function
[0003] However, the above scheduling model cannot be applied to the multi-task scheduling with multiple competing agents; especially for the multi-task scheduling technology under the cloud manufacturing platform, which contains multiple competing agents, the distributed resources are encapsulated in the cloud The centralized cloud manufacturing platform in manufacturing is managed; the above-mentioned existing models that only consider multi-agent single task or only consider multi-task single agent cannot effectively solve the problem.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Multi-task Scheduling Method with Multiple Competing Agents
  • A Multi-task Scheduling Method with Multiple Competing Agents
  • A Multi-task Scheduling Method with Multiple Competing Agents

Examples

Experimental program
Comparison scheme
Effect test

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 ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a multi-task scheduling method with multiple competing agents, which comprises the following steps: set m agents, and agent i has a group of jobs; both machines and jobs are available at zero time, and the machines are at most Process a job; among m agents, agent 1 is a long-term critical agent with high priority, while other agents are short-term one-time agents, each agent has its own objective function to be optimized that only depends on the completion time of its own job; A problem is constructed for the above objective function, and the problem is solved to obtain a multi-task scheduling strategy with multiple competing agents. By constructing a multi-agent and multi-task scheduling model, the present invention can obtain a multi-agent multi-task scheduling schedule to fill the research gap of multi-agent multi-task scheduling and adapt to the scheduling requirements of the cloud manufacturing platform environment.

Description

technical field [0001] The invention relates to the technical field of cloud manufacturing platforms, in particular to a multi-task scheduling method with multiple competing agents. Background technique [0002] In the existing scheduling technology field, multi-agent scheduling and multi-task scheduling are usually adopted. Among them, multi-agent scheduling refers to the process of assigning services over time to perform a set of tasks (jobs) requested by two or more competing agents, while satisfying certain constraints; where each agent wishes to optimize only the The objective function of the completion time of its own task. Since the goals of agents are often conflicting, they need to negotiate on how to share limited resources to optimize their own goal functions. Extensive research has been done on a variety of multi-agent scheduling models with various constraints and performance criteria from different production environments; that is, the prior art studies the s...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F9/48
CPCG06F9/4881
Inventor 殷允强王杜娟余玉刚李想
Owner UNIV OF ELECTRONICS SCI & TECH OF CHINA