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: | LAU, Hoong Chuin, Lye, Kong Wei, NGUYEN, Viet Bang |
---|---|
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 |
Similar Items
-
Combinatorial approaches for hard problems in manpower scheduling
by: LAU, Hoong Chuin
Published: (1996) -
Multi-Period Combinatorial Auction Mechanism for Distributed Resource Allocation and Scheduling
by: LAU, Hoong Chuin, et al.
Published: (2007) -
Decentralized Resource Allocation and Scheduling via Walrasian Auctions with Negotiable Agents
by: CHEN, Huaxing, et al.
Published: (2010) -
Combinatorial Auction for Multi-Period Distributed Resource Allocation
by: CHENG, Shih-Fen, et al.
Published: (2007) -
Instance-specific selection of AOS methods for solving combinatorial optimisation problems via neural networks
by: TENG, Teck Hou (DENG Dehao), et al.
Published: (2018)