The algorithm for applying the process maturity model to improve business processes in organization

Business process management contributes to the effective operation of an organization with greater customer focus and a high level of productivity. These advantages have the potential to overcome the high level of competition; however, optimizing business processes in specific organizations is a cha...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Omskij naučnyj vestnik. Seriâ "Obŝestvo. Istoriâ. Sovremennostʹ" Ročník 8; číslo 3; s. 138 - 146
Hlavní autoři: Artemyeva, S. I., Kublashvili, G. S., Zaitsev, A. G.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Omsk State Technical University, Federal State Autonomous Educational Institution of Higher Education 01.09.2023
Témata:
ISSN:2542-0488, 2541-7983
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Business process management contributes to the effective operation of an organization with greater customer focus and a high level of productivity. These advantages have the potential to overcome the high level of competition; however, optimizing business processes in specific organizations is a challenge. Improving processes requires accounting for many aspects; therefore, many companies experience difficulties in managing business processes. Many practitioners and scholars work on developing business process maturity models to help organizations gradually implement business process management for specific processes and/ or for an entire portfolio of processes. The article considers the most popular maturity models. An algorithm for applying these models is developed. Theoretical principles for the development of the algorithm are represented. This algorithm allows for an ongoing maturity assessment. Based on the obtained results, the most appropriate maturity model for further optimization of business processes can be selected. Possibilities of subsequent application of the developed algorithm are considered.
ISSN:2542-0488
2541-7983
DOI:10.25206/2542-0488-2023-8-3-138-146