By Topic

Resource allocation based on combinatorial auction in e-manufacturing environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lv Cixing ; Shenyang Inst. of Autom., Chinese Acad. of Sci., Beijing, China ; Zhu Yunlong ; Yin Chaowan

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.

Published in:

Computer and Information Technology, 2005. CIT 2005. The Fifth International Conference on

Date of Conference:

21-23 Sept. 2005