EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
170. Multi-agent Parallel Machine Scheduling based on Auction
Invited abstract in session WC-49: Machine scheduling problems, stream Lot Sizing, Lot Scheduling and Production Planning.
Wednesday, 12:30-14:00Room: M1 (building: 101)
Authors (first author is the speaker)
| 1. | Shudong Sun
|
| Industrial Engineering, Northwestern Polytechnical Uni. |
Abstract
A dynamic iterative auction-based approach is developed to solve the multi-agent scheduling problem with parallel machines. In the proposed approach, an auction procedure is established for dynamic jobs participating in a real-time auction. A straightforward and easy-to-implement bidding strategy without price is presented to reduce the complexity of the bid determination. An adaptive Hungarian algorithm is applied to solve the winner determination problem. An analysis is conducted to show that the proposed approach is individual rationality and that the myopic bidding strategy is a weakly dominant strategy for consumer to submit bids. Extensive simulation results show that the developed approach can get high-quality solutions and have considerable stability on large-scale problems.
Keywords
- Scheduling
- Auctions / Competitive Bidding
- Agent Systems
Status: accepted
Back to the list of papers