Negotiation policy for multi-Agent based agile production scheduling

To solve the problem of resource allocation in the multi-Agent-based agile production scheduling,combinatorial auction based negotiation policy was proposed.With the description of the resource allocation problem,the design and the process of the combinatorial auction were provided based on combinatorial auction solution by utilizing the relationship between dual theory and combinatorial auction.With reference to the design result and auction process,the negotiation policy to realize the combinatorial auction was depicted and constructed by adoption of distributed rules,which would be saved in the rule base of corresponding Agents.The resource allocation problem was solved by the combinatorial auction in the distributed manner.Furthermore,the computational complexity and communication bottleneck of the negotiation policy were analyzed.Computational experiments suggested that the policy was feasible and effective.