@inproceedings{dcc1095400fb45af988e9c36826ef4a4,
title = "Estimating the probability of meeting a deadline in hierarchical plans",
abstract = "Given a hierarchical plan (or schedule) with uncertain task times, we may need to determine the probability that a given plan will satisfy a given deadline. This problem is shown to be NP-hard for series-parallel hierarchies. We provide a polynomial-time approximation algorithm for it. Computing the expected makespan of an hierarchical plan is also shown to be NP-hard. We examine the approximation bounds empirically and demonstrate where our scheme is superior to sampling and to exact computation.",
author = "Liat Cohen and Shimony, \{Solomon Eyal\} and Gera Weiss",
year = "2015",
month = jan,
day = "1",
language = "English",
series = "IJCAI International Joint Conference on Artificial Intelligence",
publisher = "International Joint Conferences on Artificial Intelligence",
pages = "1551--1557",
editor = "Michael Wooldridge and Qiang Yang",
booktitle = "IJCAI 2015 - Proceedings of the 24th International Joint Conference on Artificial Intelligence",
note = "24th International Joint Conference on Artificial Intelligence, IJCAI 2015 ; Conference date: 25-07-2015 Through 31-07-2015",
}