Robust Partial Order Schedules for RCPSP/max with Durational Uncertainty

In this work, we consider RCPSP/max with durational uncertainty. We focus on computing robust Partial Order Schedules (or, in short POS) which can be executed with risk controlled feasibility and optimality, i.e., there is stochastic posteriori quality guarantee that the derived POS can be executed...

Full description

Saved in:
Bibliographic Details
Main Authors: FU, Na, Pradeep VARAKANTHAM, LAU, Hoong Chuin
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2016
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/3310
https://ink.library.smu.edu.sg/context/sis_research/article/4312/viewcontent/RobustPartialOrderSchedulesforRCPSP_maxwithDurationalUncertainty_ICAPS2016_.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-4312
record_format dspace
spelling sg-smu-ink.sis_research-43122020-10-09T05:32:36Z Robust Partial Order Schedules for RCPSP/max with Durational Uncertainty FU, Na Pradeep VARAKANTHAM, LAU, Hoong Chuin In this work, we consider RCPSP/max with durational uncertainty. We focus on computing robust Partial Order Schedules (or, in short POS) which can be executed with risk controlled feasibility and optimality, i.e., there is stochastic posteriori quality guarantee that the derived POS can be executed with all constraints honored and completion before robust makespan. To address this problem, we propose BACCHUS: a solution method on Benders Accelerated Cut Creation for Handling Uncertainty in Scheduling. In our proposed approach, we first give an MILP formulation for the deterministic RCPSP/max and partition the model into POS generation process and start time schedule determination. Then we develop Benders algorithm and propose cut generation scheme designed for effective convergence to optimality for RCPSP/max. To account for durational uncertainty, we extend the deterministic model by additional consideration of duration scenarios. In the extended MILP, the risks of constraint violation and failure to meet robust makespan are counted during POS exploration. We then approximate the uncertainty problem with computing a risk value related percentile of activity durations from the uncertainty distributions. Finally, we apply Pareto cut generation scheme and propose heuristics for infeasibility cuts to accelerate the algorithm process. Experimental results demonstrate that BACCHUS efficiently and effectively generates robust solutions for scheduling under uncertainty 2016-06-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/3310 https://ink.library.smu.edu.sg/context/sis_research/article/4312/viewcontent/RobustPartialOrderSchedulesforRCPSP_maxwithDurationalUncertainty_ICAPS2016_.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 Computer Sciences Theory and Algorithms
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Computer Sciences
Theory and Algorithms
spellingShingle Computer Sciences
Theory and Algorithms
FU, Na
Pradeep VARAKANTHAM,
LAU, Hoong Chuin
Robust Partial Order Schedules for RCPSP/max with Durational Uncertainty
description In this work, we consider RCPSP/max with durational uncertainty. We focus on computing robust Partial Order Schedules (or, in short POS) which can be executed with risk controlled feasibility and optimality, i.e., there is stochastic posteriori quality guarantee that the derived POS can be executed with all constraints honored and completion before robust makespan. To address this problem, we propose BACCHUS: a solution method on Benders Accelerated Cut Creation for Handling Uncertainty in Scheduling. In our proposed approach, we first give an MILP formulation for the deterministic RCPSP/max and partition the model into POS generation process and start time schedule determination. Then we develop Benders algorithm and propose cut generation scheme designed for effective convergence to optimality for RCPSP/max. To account for durational uncertainty, we extend the deterministic model by additional consideration of duration scenarios. In the extended MILP, the risks of constraint violation and failure to meet robust makespan are counted during POS exploration. We then approximate the uncertainty problem with computing a risk value related percentile of activity durations from the uncertainty distributions. Finally, we apply Pareto cut generation scheme and propose heuristics for infeasibility cuts to accelerate the algorithm process. Experimental results demonstrate that BACCHUS efficiently and effectively generates robust solutions for scheduling under uncertainty
format text
author FU, Na
Pradeep VARAKANTHAM,
LAU, Hoong Chuin
author_facet FU, Na
Pradeep VARAKANTHAM,
LAU, Hoong Chuin
author_sort FU, Na
title Robust Partial Order Schedules for RCPSP/max with Durational Uncertainty
title_short Robust Partial Order Schedules for RCPSP/max with Durational Uncertainty
title_full Robust Partial Order Schedules for RCPSP/max with Durational Uncertainty
title_fullStr Robust Partial Order Schedules for RCPSP/max with Durational Uncertainty
title_full_unstemmed Robust Partial Order Schedules for RCPSP/max with Durational Uncertainty
title_sort robust partial order schedules for rcpsp/max with durational uncertainty
publisher Institutional Knowledge at Singapore Management University
publishDate 2016
url https://ink.library.smu.edu.sg/sis_research/3310
https://ink.library.smu.edu.sg/context/sis_research/article/4312/viewcontent/RobustPartialOrderSchedulesforRCPSP_maxwithDurationalUncertainty_ICAPS2016_.pdf
_version_ 1770573083437957120