2005•Unpublished venueRequires access

Resource allocation based on combinatorial auction in e-manufacturing environment

Cixing Lv, Zhu Yunlong, Yin Chaowan

Open publisher page 1 citations

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

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

Key concepts: Combinatorial auction, Computer science, Negotiation, Auction algorithm, Resource allocation, Resource (disambiguation), Mathematical optimization, Distributed computing

Related papers

Back to paper searchBrowse research topicsOriginal source
Resource allocation based on combinatorial auction in e-manufacturing environment — Research Paper | ScholarLens