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

Parallel machine multi-agent auction negotiation scheduling method

A scheduling method and multi-agent technology, applied in business, data processing applications, instruments, etc., can solve the problems that individual goals are not fully met and cannot be directly expanded

Active Publication Date: 2020-12-18
NORTHWESTERN POLYTECHNICAL UNIV
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This method can generate a solution with better overall benefit of the system through the centralized scheduling of the central decision maker, and the method is more efficient when solving large-scale tasks, but this method only considers the upper limit of the user's goal and does not directly optimize the user's individual goal, making The user's individual goals are not fully satisfied, and the method is only suitable for two agents and cannot be directly extended to multiple agent scheduling problems

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
  • Parallel machine multi-agent auction negotiation scheduling method
  • Parallel machine multi-agent auction negotiation scheduling method
  • Parallel machine multi-agent auction negotiation scheduling method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0085] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0086] Such as Figure 1 to Figure 3 As shown, the present invention provides a parallel machine multi-agent auction negotiation scheduling method, comprising the following steps:

[0087] Step 1: Initialize parallel machine multi-agent scheduling:

[0088] Step 1-1: Set the set of agents participating in the auction negotiation scheduling as {A 0 ,A 1 ,A 2 ,...,A i ,...A n}, where A 0 For the resource agent, A i is the user agent, n is the total number of agents, i=1,2,...,n;

[0089] Step 1-2: Set User Agent A i has a set of workpieces to be processed in Represents user agent A i The kth workpiece to be processed, n i Represents user agent A i The total number of workpieces to be processed;

[0090] Set the workpiece to be processed The processing time is Deadline is and The income is ρ (i) defer to user agent A for artifac...

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 parallel machine multi-agent auction negotiation scheduling method. Firstly, a user agent issues a demand time request according to information of a to-be-machined workpieceof the user agent; then, the resource agent determines an auction time slot set and issues an initial key price according to the request information and the idle condition of the machine; the user agents publish bidding schemes according to respective bidding strategies; then, the resource agent makes a calibration decision according to the bidding situation and adjusts the auction product price;and the user agent updates the bidding scheme according to the adjusted essentials and submits the bidding scheme again, and the process is repeated until the two parties achieve balance and then a new round of auction negotiation is started until all the workpieces are scheduled. According to the method, a scheduling scheme generated by negotiation can fully meet each agent target; the application range limit that a traditional method is only suitable for two agents is broken through, and the scheduling problem of multiple user agents can be solved.

Description

technical field [0001] The invention belongs to the field of production scheduling, and in particular relates to a multi-agent scheduling method for a parallel machine. Background technique [0002] Parallel machine multi-agent scheduling is a new type of scheduling problem in the individualized production mode. Compared with the traditional parallel machine scheduling problem, the scheduling core is based on the relevant goals of the production resource side, such as reducing the manufacturing cost of the production enterprise and improving the machine utilization rate, while the parallel machine multi-agent scheduling problem is based on fully meeting the individual needs of users. . [0003] Document "Yazdani M, Khalili S M, Jolai F.A parallel machine scheduling problem with two-agent and tool change activities: an efficient hybrid metaheuristic algorithm. International Journal of Computer Integrated Manufacturing, 2016, 29 (10): 1075-1088." Multi-agent Scheduling Optim...

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/06G06Q30/08
CPCG06Q10/06312G06Q30/08Y02P90/30
Inventor 孙树栋刘亚琼王雪冬吴自高代进伦常昇博俞少华
Owner NORTHWESTERN POLYTECHNICAL UNIV