Publication at Faculty of Mathematics and Physics |
2010
Abstract
Precedence networks can naturally describe workflows. Frequently, it is important to model alternative routes in the workflow and to select the best alternative while respecting various constraints.
In this paper we suggest how to extend an existing model of Nested Temporal Networks with Alternatives by adding preferences on alternatives. We also show how to effectively reason on preferences, namely how to compute the lower and upper bounds for the cost of the schedule by using a newly introduced equivalence tree.