A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems
Computing an optimal solution to an integer program for a realistic scheduling problem can often be very time consuming. As a result, ad-hoc and hand-crafted heuristics have become popular alternatives. These methods, however, suffer from the inability to guarantee good or optimal solutions. Our obj...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2008
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/364 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| Summary: | Computing an optimal solution to an integer program for a realistic scheduling problem can often be very time consuming. As a result, ad-hoc and hand-crafted heuristics have become popular alternatives. These methods, however, suffer from the inability to guarantee good or optimal solutions. Our objective in this work is to leverage on prior theoretical results from the OR literature and agent technology from the AI literature to derive a computational framework that can be easily implemented for solving decentralized scheduling problems. In decentralization, there is an issue that information and control are inherently private to individual agents, even though a solution has to be jointly derived. In this paper, we are concerned about the following class of decentralized scheduling problems: 1 There is a central pool of limited resources that comprises multiple units of resources for each machine type; 1 There are multiple self-interested agents and each has to obtain resources from the central pool to solve its own scheduling problem (job shop, flow shop, etc). |
|---|