Name
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 ≤ E ≤ 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. W e also apply RTCN to solve the stochastic project crashing problem. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICTAI.2005.111 | ICTAI |
Keywords | Field | DocType |
computationally tractable,w e,possible instantiation,rtcn problem,temporal network,random variable,temporal constraint network,simple temporal constraint network,activity duration,robust temporal constraint network,artificial intelligent,confidence level,planning,artificial intelligence,scheduling | Random variable,Mathematical optimization,Job shop scheduling,Computer science,Scheduling (computing),Constraint theory,Artificial intelligence,Machine learning,Bounded function | Conference |
ISSN | ISBN | Citations |
1082-3409 | 0-7695-2488-5 | 1 |
PageRank | References | Authors |
0.36 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| IIoong Chuin Lau | 1 | 1 | 0.36 |
| Thomas Ou | 2 | 7 | 0.82 |
| Melvyn Sim | 3 | 1909 | 117.68 |