|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 29 of 32 found articles
| Title: |
On combinatorial auction and Lagrangean relaxation for distributed resource scheduling |
| Author: |
Kutanoglu, Erhan Wu, S. David |
| Appeared in: |
IIE transactions |
| Paging: | Volume 31 (1999) nr. 9 pages 813-826 |
| Year: |
1999-09-01 |
| Contents: |
Most existing methods for scheduling are based on centralized or hierarchical decision making using monolithic models. In ihis study, we investigate a new method based on a distributed and locally autonomous decision structure using the notion of combinatorial auction. In combinatorial auction the bidders demand a combination of dependent objects with a single bid. We show that not only can we use this auction mechanism to handle complex resource scheduling problems, but there exist strong links between combinatorial auction and Lagrangean-based decomposition. Exploring some of these properties, we characterize combinatorial auction using auction protocols and payment functions. This study is a first step toward developing a distributed scheduling framework that maintains system-wide performance while accommodating local preferences and objectives. We provide some insights to this framework by demonstrating four different versions of the auction mechanism using job shop scheduling problems. |
| Publisher: |
Taylor & Francis |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 29 of 32 found articles
| << previous | next >> |