An approximate analysis of expected cycle time in business process execution

  • Authors:
  • Byung-Hyun Ha;Hajo A. Reijers;Joonsoo Bae;Hyerim Bae

  • Affiliations:
  • Dept. of Industrial Engineering, Pusan National Univ., Pusan, Korea;Dept. of Technology Management, Eindhoven Univ., Eindhoven, The Netherlands;Dept. of Industrial & Sys, Eng., Chonbuk National Univ., Jeonju, Jeonbuk, Korea;Dept. of Industrial Engineering, Pusan National Univ., Pusan, Korea

  • Venue:
  • BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The accurate prediction of business process performance during its design phase can facilitate the assessment of existing processes and the generation of alternatives. In this paper, an approximation method to estimate the cycle time of a business process is introduced. First, we propose a process execution scheme, with which Business Process Management Systems (BPMS) can control the execution of processes. Second, an approximation method for analyzing its cycle time, based on queueing theory, is presented. We consider agents as queueing servers with multi-class customers and predict the response time of the agents. The cycle time of the whole process is calculated using the expected response time and process structure, taking into account parallel process execution. Finally, the results from the analytical approximation are validated against those of a simulation. This analysis can be used to obtain an optimal process execution plan.