Run-time planning of case-based business processes

Abstract : Context: Organizations act in highly competitive markets, which forces them to be flexible. Constantly changing business requirements require flexible business processes. Case Management Model and Notation (CMMN) supports modeling run-time flexibility of partially structured business process models, but does not fully specify the control flow. Objective: The goal is to develop a planning algorithm that supports the case worker in planning case-based business processes at run-time. Method: We identify the requirements of run-time planning of partly structured processes by analyzing the admission process for the master degree at FHNW. To plan the process instance, we develop a planning algorithm. Our planning algorithm is evaluated using concrete cases provided by FHNW in order to demonstrate real application. Results: The planning algorithm reflects the requirements for serializing tasks at run-time. Conclusion: Our planning algorithm allows to automatically deriving context-specific execution plans for CMMN models at run-time.
Document type :
Conference papers
Complete list of metadatas

https://hal-paris1.archives-ouvertes.fr/hal-01423708
Contributor : Danillo Sprovieri <>
Submitted on : Saturday, December 31, 2016 - 12:58:10 AM
Last modification on : Friday, September 27, 2019 - 12:16:04 PM
Long-term archiving on : Saturday, April 1, 2017 - 12:09:37 PM

File

RCIS2016_Run-Time Planning of ...
Files produced by the author(s)

Identifiers

Collections

Citation

Danillo Sprovieri, Daniel Diaz, Raúl Mazo, Knut Hinkelmann. Run-time planning of case-based business processes. IEEE 10th International Conference on Research Challenges in Information Science, Jun 2016, Grenoble, France. pp.1 - 6, ⟨10.1109/RCIS.2016.7549282⟩. ⟨hal-01423708⟩

Share

Metrics

Record views

178

Files downloads

514