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...

Full description

Saved in:
Bibliographic Details
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
id sg-smu-ink.sis_research-2599
record_format dspace
spelling sg-smu-ink.sis_research-25992013-11-25T09:24:08Z Robust distributed scheduling via time period aggregation CHENG, Shih-Fen Tajan, John LAU, Hoong Chuin 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 framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation of the process decreases as the time frame length (time frames are obtained by aggregating time periods) increases. This is achieved without causing substantial deterioration in the mean performance. The main driver for the increase in robustness is that longer time frames result in allocations where resources are assigned in longer contiguous time blocks. The resulting resource continuity allows bidders to shift schedules upon realization of stochasticity. To demonstrate the generality of the notion that resource continuity increases allocation robustness, we perform further experiments on a decentralized variant of the classical job shop scheduling problem. The experiment results demonstrate similar benefits. 2012-01-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/1600 info:doi/10.3233/WIA-2012-0248 https://ink.library.smu.edu.sg/context/sis_research/article/2599/viewcontent/time_aggre_final_online.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University market-based resource allocation uncertainty auction scheduling robustness Artificial Intelligence and Robotics Business Operations Research, Systems Engineering and Industrial Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic market-based resource allocation
uncertainty
auction
scheduling
robustness
Artificial Intelligence and Robotics
Business
Operations Research, Systems Engineering and Industrial Engineering
spellingShingle market-based resource allocation
uncertainty
auction
scheduling
robustness
Artificial Intelligence and Robotics
Business
Operations Research, Systems Engineering and Industrial Engineering
CHENG, Shih-Fen
Tajan, John
LAU, Hoong Chuin
Robust distributed scheduling via time period aggregation
description 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 framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation of the process decreases as the time frame length (time frames are obtained by aggregating time periods) increases. This is achieved without causing substantial deterioration in the mean performance. The main driver for the increase in robustness is that longer time frames result in allocations where resources are assigned in longer contiguous time blocks. The resulting resource continuity allows bidders to shift schedules upon realization of stochasticity. To demonstrate the generality of the notion that resource continuity increases allocation robustness, we perform further experiments on a decentralized variant of the classical job shop scheduling problem. The experiment results demonstrate similar benefits.
format text
author CHENG, Shih-Fen
Tajan, John
LAU, Hoong Chuin
author_facet CHENG, Shih-Fen
Tajan, John
LAU, Hoong Chuin
author_sort CHENG, Shih-Fen
title Robust distributed scheduling via time period aggregation
title_short Robust distributed scheduling via time period aggregation
title_full Robust distributed scheduling via time period aggregation
title_fullStr Robust distributed scheduling via time period aggregation
title_full_unstemmed Robust distributed scheduling via time period aggregation
title_sort robust distributed scheduling via time period aggregation
publisher Institutional Knowledge at Singapore Management University
publishDate 2012
url 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
_version_ 1770571313425940480