Multi-agent scheduling segmented coordination optimization method

A coordinated optimization, segmented technology, applied in business, instrument, data processing applications, etc., can solve the problem of low efficiency of conflict mediation

Active Publication Date: 2018-08-24
NORTHWESTERN POLYTECHNICAL UNIV
View PDF9 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] Aiming at the problem of low efficiency of conflict mediation in traditional scheduling, the present invention proposes a segmented coordination optimization method for multi-agent scheduling

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
  • Multi-agent scheduling segmented coordination optimization method
  • Multi-agent scheduling segmented coordination optimization method
  • Multi-agent scheduling segmented coordination optimization method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0040] Now in conjunction with embodiment, accompanying drawing, the present invention will be further described:

[0041]In the method of the present invention, a three-layer distributed negotiation scheduling system of intra-autonomous group scheduling-inter-autonomous group scheduling-conflict arbitration is established to resolve resource conflicts in the scheme. First, the resource agent randomly generates several feasible plans and sends them to the user. At the same time, the user agent independently selects the processing time of its workpiece on each resource according to its own goals; The goal is to score each plan and feed back the scores to the resource agent. The resource agent calculates the score of each plan according to the score fed back by the user agent and the weight of each user agent, and selects the plan with the highest score as the initial plan; the resource agent The initial scheme is adjusted and updated according to the matching results of the use...

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 relates to a multi-agent scheduling segmented coordination optimization method. The method includes the following steps: firstly, a resource agent randomly generates several feasible schemes and sends the schemes to users, and the user agents independently carry out selection of processing time periods of workpieces on resources according to goals of the user agents; after receivingthe schemes, the user agents grade the schemes according to the goals and give feedback of scores to the resource agent, the resource agent calculates scores of the schemes on the basis of the scoresprovided by the user agents as well as weights of the user agents, and selects the scheme with the highest score as an initial scheme; the resource agent adjusts and updates the initial scheme according to selection results of the user agents who gives a score lower than a threshold value for the initial scheme and then makes the initial scheme as a current scheme; and conflict detection is conducted on the current scheme, the scheduling is completed if there is no conflict, otherwise, scheduling within autonomous groups is carried out.

Description

technical field [0001] The invention belongs to the field of production scheduling, and specifically relates to a segmented coordination and optimization method for multi-agent scheduling. Background technique [0002] The document "Multi-agent single-machine scheduling problem based on combined auction. Computer Integrated Manufacturing System, 2013, 19(1): 106-113." discloses a multi-agent scheduling mechanism based on repeated bidding combined auction. This mechanism combines the general form of combinatorial auction with the modeling technology of machine scheduling, and establishes a multi-agent scheduling model based on combinatorial auction to schedule and allocate resource occupancy time. Use the bidding mechanism, adjust the arrival time and delivery period to coordinate the conflict in the scheduling process. To a certain extent, the utilization efficiency of the machine is improved, and the customer satisfaction is improved at the same time. However, when this m...

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 Applications(China)
IPC IPC(8): G06Q10/06G06Q10/04G06Q30/08
CPCG06Q10/04G06Q10/06311G06Q10/06316G06Q30/08
Inventor 孙树栋陈丽珍吴自高肖世昌俞少华杨宏安王军强安凯张家豪
Owner NORTHWESTERN POLYTECHNICAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap