A combinatorial auctions perspective on min-sum scheduling problems.
Yunpeng PanPublished in: CASE (2013)
Keyphrases
- combinatorial auctions
- scheduling problem
- min sum
- np hard
- approximation algorithms
- winner determination
- resource allocation
- special case
- single item
- multi unit combinatorial auctions
- mechanism design
- multi item
- multi unit
- mathematical programming
- lower bound
- bidding strategies
- goal programming
- tabu search
- lot sizing
- min cut