Robust distributed scheduling via time period aggregation
In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium...
Saved in:
Main Authors: | CHENG, Shih-Fen, Tajan, John, LAU, Hoong Chuin |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2012
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1600 https://ink.library.smu.edu.sg/context/sis_research/article/2599/viewcontent/time_aggre_final_online.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Distributing complementary resources across multiple periods with stochastic demand
by: CHENG, Shih-Fen, et al.
Published: (2008) -
Decentralized Resource Allocation and Scheduling via Walrasian Auctions with Negotiable Agents
by: CHEN, Huaxing, et al.
Published: (2010) -
Robust execution strategies for project scheduling with unreliable resources and stochastic durations
by: FU, Na, et al.
Published: (2015) -
Robust Temporal Constraint Networks
by: LAU, Hoong Chuin, et al.
Published: (2005) -
Finding robust-under-risk solutions for flowshop scheduling
by: Kimbrough, Steven O., et al.
Published: (2011)