On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Constraint-directed techniques for scheduling alternative activities
Artificial Intelligence
Automatic Control of Workflow Processes Using ECA Rules
IEEE Transactions on Knowledge and Data Engineering
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Temporal Reasoning in Nested Temporal Networks with Alternatives
Recent Advances in Constraints
Handling alternative activities in resource-constrained project scheduling problems
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Executing reactive, model-based programs through graph-based temporal planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
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.