By Topic

Allocating Resources in Multiagent Flowshops With Adaptive Auctions

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
$33 $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

4 Author(s)
Hoong Chuin Lau ; School of Information Systems, Singapore Management University, Singapore ; Zhengyi John Zhao ; Shuzhi Sam Ge ; Tong Heng Lee

In this paper, we consider the problem of allocating machine resources among multiple agents, each of which is responsible to solve a flowshop scheduling problem. We present an iterated combinatorial auction mechanism in which bid generation is performed within each agent, while a price adjustment procedure is performed by a centralized auctioneer. While this approach is fairly well-studied in the literature, our primary innovation is in an adaptive price adjustment procedure, utilizing variable step-size inspired by adaptive PID-control theory coupled with utility pricing inspired by classical microeconomics. We compare with the conventional price adjustment scheme proposed in Fisher (1985), and show better convergence properties. Our secondary contribution is in a fast bid-generation procedure executed by the agents based on local search. Putting both these innovations together, we compare our approach against a classical integer programming model as well as conventional price adjustment schemes, and show drastic run time improvement with insignificant loss of global optimality.

Published in:

IEEE Transactions on Automation Science and Engineering  (Volume:8 ,  Issue: 4 )