Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/130106
DC Field | Value | |
---|---|---|
dc.title | Robust local search and its application to generating robust schedules | |
dc.contributor.author | Lau, H.C. | |
dc.contributor.author | Ou, T. | |
dc.contributor.author | Xiao, F. | |
dc.date.accessioned | 2016-11-11T08:01:00Z | |
dc.date.available | 2016-11-11T08:01:00Z | |
dc.date.issued | 2007 | |
dc.identifier.citation | Lau, H.C., Ou, T., Xiao, F. (2007). Robust local search and its application to generating robust schedules. ICAPS 2007, 17th International Conference on Automated Planning and Scheduling : 208-215. ScholarBank@NUS Repository. | |
dc.identifier.isbn | 9781577353447 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/130106 | |
dc.description.abstract | In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from scenario-based or stochastic programming approaches often used to tackle uncertainty. Given a value 0 < ∈ ≤ 1, we are interested to know what the robust objective value is, i.e. the optimal value if we allow an ∈ chance of not meeting it, assuming that certain data values are denned on bounded random variables. We show how a standard local search or metaheuristic routine can be extended to efficiently construct a decision rule with such guarantee, albeit heuristically. We demonstrate its practical applicability on the Resource Constrained Project Scheduling Problem with minimal and maximal time lags (RCPSP/max) taking into consideration activity duration uncertainty. Experiments show that, partial order schedules can be constructed that are robust in our sense without the need for a large planned horizon (due date), which improves upon the work proposed by Policella et al. 2004. Copyright © 2007, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | THE LOGISTICS INSTITUTE - ASIA PACIFIC | |
dc.description.sourcetitle | ICAPS 2007, 17th International Conference on Automated Planning and Scheduling | |
dc.description.page | 208-215 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.