Combinatorial Auctions for Coordination and Control of Manufacturing MAS: Updating Prices Methods
We use the paradigm of multiagent systems to solve the Job Shop problem. It concerns the allocation of machines to operations of some production process over time periods and its goal is the optimization of one or several objectives. We propose a combinatorial auction mechanism to coordinate agents. The “items” to be sold are the time slots that we divide the time horizon into. In tasks scheduling problems tasks need a combination of time slots of multiple resources to do the operations. The use of auctions in which different valuations of interdependent items are considered (e.g. combinatorial auctions) is necessary. The auctioneer fixes prices comparing the demand over a time slot of a resource with the capacity of the resource in this time slot. Our objective is to find an updating price method for combinatorial auctions that meet the needings of scheduling manufacturing systems in dynamic environments, e.g. robustness, stability, adaptability, and efficient use of available resources.
KeywordsTime Slot Multiagent System Lagrangian Relaxation Combinatorial Auction Subgradient Method
Unable to display preview. Download preview PDF.
- 6.Kutanoglu, E., Wu, S.D.: On combinatorial auction and Lagrangean relaxation for distributed resource scheduling. IIE Transactions 31(9), 813–826 (1999)Google Scholar
- 12.Geoffrion, A.M.: Lagrangean relaxation for integer programming. En Approaches to Integer Programming, 82–114 (1974), http://dx.doi.org/10.1007/BFb0120690 (Accedido Mayo 20, 2009)
- 15.Camerini, P.M., Fratta, L., Maffioli, F.: On improving relaxation methods by modified gradient techniques. En Nondifferentiable Optimization, 26–34 (1975), http://dx.doi.org/10.1007/BFb0120697 (Accedido Junio 3, 2009)
- 17.Zhao, X., Luh, P., Wang, J.: The surrogate gradient algorithm for Lagrangian relaxation method. In: Proceedings of the 36th IEEE Conference on Decision and Control, vol. 1, pp. 305–310 (1997)Google Scholar