Please use this identifier to cite or link to this item:
|Title:||Utility pricing auction for multi-period resource allocation in multi-machine flow shop problems|
|Source:||Lau, H.C.,Zhao, Z.J.,Ge, S.S.,Lee, T.H. (2008). Utility pricing auction for multi-period resource allocation in multi-machine flow shop problems. ACM International Conference Proceeding Series : -. ScholarBank@NUS Repository. https://doi.org/10.1145/1409540.1409547|
|Abstract:||In this paper, we consider a multi-machine multi-period resource allocation problem among multiple agents, each of which is responsible to solve a flowshop scheduling problem. We present an iterated combinatorial auction approach in which bid generation is performed within each agent, and the concept of utility pricing is then applied in the process of price adjustment. We compare with the conventional price adjustment scheme proposed in Fisher (1985), and show better convergence properties. Experimentally, we compare our approach against an integer programming model as well as conventional price adjustment schemes, and achieve drastic run time improvement. Copyright 2008 ACM.|
|Source Title:||ACM International Conference Proceeding Series|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 11, 2017
checked on Dec 16, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.