Please use this identifier to cite or link to this item:
|Title:||Robust Temporal Constraint Network|
|Keywords:||Planning and scheduling|
|Source:||Lau, H.C.,Ou, T.,Sim, M. (2005). Robust Temporal Constraint Network. Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI 2005 : 82-88. ScholarBank@NUS Repository. https://doi.org/10.1109/ICTAI.2005.111|
|Abstract:||In this paper, we propose the Robust Temporal Constraint Network (RTCN) model for simple temporal constraint networks where activity durations are bounded by random variables. The problem is to determine whether such temporal network can be executed with failure probability less than a given 0 ≤ ε ≤ 1 for each possible instantiation of the random variables, and if so, how one might find a feasible schedule with each given instantiation. The advantage of our model is that one can vary the value of ε to control the level of conservativeness of the solution. We present a computationally tractable and efficient approach to solve these RTCN problems. We study the effects the density of temporal constraint networks have on its makespan under different confidence levels. We also apply RTCN to solve the stochastic project crashing problem. © 2005 IEEE.|
|Source Title:||Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 16, 2018
checked on Jan 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.