Skip to main content
SpringerLink
Log in
Book cover

International Conference on Information Technologies and Mathematical Modelling

ITMM 2016: Information Technologies and Mathematical Modelling - Queueing Theory and Applications pp 315–326Cite as

Analysis of Business Process Execution Time with Queueing Theory Models

Part of the Communications in Computer and Information Science book series (CCIS,volume 638)

Abstract

In the paper an approach to the analysis of business process efficiency is proposed. A method for the estimation of a business process execution time as an important performance measure of business processes efficiency is developed. It represents a combination of queuing networks modelling and simplex algorithm of linear programming. The method allows the calculating of the minimum business processes execution time. A method of optimizing activity of the telecommunication company at a predetermined threshold for the business processes execution time is given. The developed technique was illustrated with an end-to-end business process flow “Request-to-Answer” with initial data close to reality.

Keywords

  • Optimization
  • Business process
  • Queueing theory
  • Execution time
  • Delay
  • Simplex algorithm

The reported study was partially supported by the RFBR, research projects No. 14-07-00090, 15-07-03051, 15-07-03608; Vladimir Potanin Foundation.

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. van der Aalst, W.M.P., Christian, S.: Modeling Business Processes: A Petri Net-oriented Approach, pp. 1–386. The MIT Press, London (2011)

    MATH  Google Scholar 

  2. Oracle Crystal Ball. www.oracle.com/us/products/applications/crystalball/crystal-ball-product/overview/index.html. Accessed 01 May 2016

  3. Sidnev, A., Tuominen, J., Krassi, B.: Business process modeling and simulation. Helsinki University of Technology. Industrial Information Technology Laboratory Publications, pp. 1–116 (2005)

    Google Scholar 

  4. ARIS Business Simulator. www.ariscommunity.com/business-process-simulation. Accessed 01 Apr 2016

  5. Baskett, F., Chandy, K.M., Muntz, R.R., Palacios, F.G.: Open, closed, and mixed networks of queues with different classes of customers. J. ACM 22(2), 248–260 (1975)

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Ficken, F.A.: The Simplex Method of Linear Programming. Dover Books, New York (2015)

    MATH  Google Scholar 

  7. Mantepu, T.M., Solly, M.S.: Modelling and measuring milestones in business process optimization. Probl. Persp. Manage. 12(4), 221–224 (2014)

    Google Scholar 

  8. TeleManagement Forum. Enhanced Telecom Operations (eTOM) The Business Process Framework. www.tmforum.org. Accessed 01 May 2016

  9. Business Process Model and Notation (BPMN). Version 2.0.2: OMG Document Number: formal.2013-12-09. Object Management Group (2013)

    Google Scholar 

  10. Business process framework (eTOM). End-to-end business flows. GB921 Addendum E. R15.0.0., pp. 1–110 (2016)

    Google Scholar 

  11. Moiseeva, S.P., Zakhorolnaya, I.A.: Mathematical model of parallel retrial queueing of multiple requests. Optoelectron. Instrum. Data Process. 47(6), 567–572 (2011)

    CrossRef  Google Scholar 

  12. Nazarov, A.A., Moiseev, A.N.: Distributed system of processing of data of physical experiments. Russ. Phys. J. 57(7), 984–990 (2014)

    CrossRef  Google Scholar 

  13. Bakholdina, M., Gortsev, A.: Joint probability density of the intervals length of modulated semi-synchronous integrated flow of events in conditions of a constant dead time and the flow recurrence conditions. In: Dudin, A., Nazarov, A., Yakupov, R., Gortsev, A. (eds.) ITMM 2014. CCIS, vol. 564, pp. 13–27. Springer, Heidelberg (2015). doi:10.1007/978-3-319-25861-4_2

    Google Scholar 

  14. Samouylov, K.E., Chukarin, A.V., Yarkina, N.V.: Business Processes and Information Technology in the Management of Telecommunications Companies, pp. 1–619. Alpina-Publishers, Randwick (2016)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Probability and Informatics, RUDN University, 6 Miklukho-Maklaya Street, 117198, Moscow, Russian Federation

    Konstantin Samouylov, Yuliya Gaidamaka & Elvira Zaripova

Authors
  1. Konstantin Samouylov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuliya Gaidamaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Elvira Zaripova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Elvira Zaripova .

Editor information

Editors and Affiliations

  1. Belarusian State University , Minsk, Belarus

    Alexander Dudin

  2. Tomsk State University , Tomsk, Russia

    Alexander Gortsev

  3. Tomsk State University , Tomsk, Russia

    Anatoly Nazarov

  4. Kemerovo State University , Anzhero-Sudzhensk, Russia

    Rafael Yakupov

Rights and permissions

Reprints and Permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Samouylov, K., Gaidamaka, Y., Zaripova, E. (2016). Analysis of Business Process Execution Time with Queueing Theory Models. In: Dudin, A., Gortsev, A., Nazarov, A., Yakupov, R. (eds) Information Technologies and Mathematical Modelling - Queueing Theory and Applications. ITMM 2016. Communications in Computer and Information Science, vol 638. Springer, Cham. https://doi.org/10.1007/978-3-319-44615-8_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44615-8_28

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44614-1

  • Online ISBN: 978-3-319-44615-8

  • eBook Packages: Computer ScienceComputer Science (R0)

search

Navigation