Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Complex Scheduling (GOR-Publications)
Complex Scheduling (GOR-Publications)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Integrating planning and scheduling in workflow domains
Expert Systems with Applications: An International Journal
Business Process Management: Concepts, Languages, Architectures
Business Process Management: Concepts, Languages, Architectures
Workflow simulation for operational decision support
Data & Knowledge Engineering
On supporting Lean methodologies using constraint-based scheduling
Journal of Scheduling
Time prediction based on process mining
Information Systems
Workflow resource patterns: identification, representation and tool support
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
Enabling Flexibility in Process-Aware Information Systems: Challenges, Methods, Technologies
Enabling Flexibility in Process-Aware Information Systems: Challenges, Methods, Technologies
Hi-index | 0.00 |
Declarative business process (BP) models are increasingly used allowing their users to specify what has to be done instead of how. Due to their flexible nature, there are several enactment plans related to a specific declarative model, each one presenting specific values for different objective functions, e.g., completion time or profit. In this work, a method for generating optimized BP enactment plans from declarative specifications is proposed to optimize the performance of a process considering multiple objectives. The plans can be used for different purposes, e.g., providing recommendations. The proposed approach is validated through an empirical evaluation based on a real-world case study.