论文信息 - Optimizing Alternatives in Precedence Networks

Optimizing Alternatives in Precedence Networks

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.

Roman Barták

[1] Gerhard Friedrich,et al. Handling Alternative Activities in Resource-Constrained Project Scheduling Problems , 2007, IJCAI.

[2] Roman Barták,et al. Temporal Networks with Alternatives: Complexity and Model , 2007, FLAIRS.

[3] Mark Abramson,et al. Executing Reactive, Model-based Programs through Graph-based Temporal Planning , 2001, IJCAI.

[4] Hyerim Bae,et al. Automatic control of workflow processes using ECA rules , 2004, IEEE Transactions on Knowledge and Data Engineering.

[5] Catriel Beeri,et al. On the Desirability of Acyclic Database Schemes , 1983, JACM.

[6] Behrokh Khoshnevis,et al. Generation of alternative process plans in integrated manufacturing systems , 2003, J. Intell. Manuf..

[7] Roman Barták,et al. Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models , 2008, AIMSA.

[8] J. Christopher Beck,et al. Constraint-directed techniques for scheduling alternative activities , 2000, Artif. Intell..

[9] Roberto Rossi,et al. Cost-Based Filtering for Stochastic Inventory Control , 2006, CSCLP.

[10] John Domingue,et al. Artificial Intelligence: Methodology, Systems, and Applications, 12th International Conference, AIMSA 2006, Varna, Bulgaria, September 12-15, 2006, Proceedings , 2006, AIMSA.

[11] Roman Barták,et al. Temporal Reasoning in Nested Temporal Networks with Alternatives , 2008, CSCLP.