Resource allocation based on combinatorial auction in e-manufacturing environment
Cixing Lv, Zhu Yunlong, Yin Chaowan
Abstract
Cixing Lv, Zhu Yunlong, Yin Chaowan
Abstract
To solve the problem of resource allocation in the e-manufacturing environment, combinatorial auction based negotiation policy was proposed in an Internet-based multi-agent system. With the formulation of the allocation problem and that of the combinatorial auction solution, the design and the procedure of the combinatorial auction are given. Then, distributed rules saved in the rule base in corresponding agents are adopted to describe and construct the negotiation policy to realize the combinatorial auction. The final part of the paper gives numerical testing to demonstrate the policy to be feasible and efficient.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
To solve the problem of resource allocation in the e-manufacturing environment, combinatorial auction based negotiation policy was proposed in an Internet-based multi-agent system. With the formulation of the allocation problem and that of the combinatorial auction solution, the design and the procedure of the combinatorial auction are given. Then, distributed rules saved in the rule base in corresponding agents are adopted to describe and construct the negotiation policy to realize the combinatorial auction. The final part of the paper gives numerical testing to demonstrate the policy to be feasible and efficient.
Key concepts: Combinatorial auction, Computer science, Negotiation, Auction algorithm, Resource allocation, Resource (disambiguation), Mathematical optimization, Distributed computing