Generating robust schedules subject to resource and duration uncertainties
We consider the Resource-Constrained Project Scheduling Problem with minimal and maximal time lags under resource and duration uncertainties. To manage resource uncertainties, we build upon the work of Lambrechts et al 2007 and develop a method to analyze the effect of resource breakdowns on activit...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2008
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/305 https://ink.library.smu.edu.sg/context/sis_research/article/1304/viewcontent/ICAPS08_011.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-1304 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-13042020-04-28T02:18:36Z Generating robust schedules subject to resource and duration uncertainties FU, Na LAU, Hoong Chuin XIAO, Fei We consider the Resource-Constrained Project Scheduling Problem with minimal and maximal time lags under resource and duration uncertainties. To manage resource uncertainties, we build upon the work of Lambrechts et al 2007 and develop a method to analyze the effect of resource breakdowns on activity durations. We then extend the robust local search framework of Lau et al 2007 with additional considerations on the impact of unexpected resource breakdowns to the project makespan, so that partial order schedules (POS) can absorb both resource and duration uncertainties. Experiments show that our proposed model is capable of addressing the uncertainty of resources, where the most robust POS is generated to minimize the robust makespan with statistical guarantee. Compared with prevailing methods, our method is also capable of achieving more feasible solutions with better robust makespan. 2008-09-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/305 https://ink.library.smu.edu.sg/context/sis_research/article/1304/viewcontent/ICAPS08_011.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 Activity durations Feasible solutions Local searches Makespan Minimal and maximal time lags Partial order schedules Statistical guarantees Artificial Intelligence and Robotics 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 |
Activity durations Feasible solutions Local searches Makespan Minimal and maximal time lags Partial order schedules Statistical guarantees Artificial Intelligence and Robotics Operations Research, Systems Engineering and Industrial Engineering |
spellingShingle |
Activity durations Feasible solutions Local searches Makespan Minimal and maximal time lags Partial order schedules Statistical guarantees Artificial Intelligence and Robotics Operations Research, Systems Engineering and Industrial Engineering FU, Na LAU, Hoong Chuin XIAO, Fei Generating robust schedules subject to resource and duration uncertainties |
description |
We consider the Resource-Constrained Project Scheduling Problem with minimal and maximal time lags under resource and duration uncertainties. To manage resource uncertainties, we build upon the work of Lambrechts et al 2007 and develop a method to analyze the effect of resource breakdowns on activity durations. We then extend the robust local search framework of Lau et al 2007 with additional considerations on the impact of unexpected resource breakdowns to the project makespan, so that partial order schedules (POS) can absorb both resource and duration uncertainties. Experiments show that our proposed model is capable of addressing the uncertainty of resources, where the most robust POS is generated to minimize the robust makespan with statistical guarantee. Compared with prevailing methods, our method is also capable of achieving more feasible solutions with better robust makespan. |
format |
text |
author |
FU, Na LAU, Hoong Chuin XIAO, Fei |
author_facet |
FU, Na LAU, Hoong Chuin XIAO, Fei |
author_sort |
FU, Na |
title |
Generating robust schedules subject to resource and duration uncertainties |
title_short |
Generating robust schedules subject to resource and duration uncertainties |
title_full |
Generating robust schedules subject to resource and duration uncertainties |
title_fullStr |
Generating robust schedules subject to resource and duration uncertainties |
title_full_unstemmed |
Generating robust schedules subject to resource and duration uncertainties |
title_sort |
generating robust schedules subject to resource and duration uncertainties |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2008 |
url |
https://ink.library.smu.edu.sg/sis_research/305 https://ink.library.smu.edu.sg/context/sis_research/article/1304/viewcontent/ICAPS08_011.pdf |
_version_ |
1770570380789940224 |