Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Optimizing a Business Process Model by Using Simulation
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
2010 (English)In: 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation, IEEE Press, 2010, 1-8 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we present the problem of optimizing a business process model with the objective of finding the most beneficial assignment of tasks to agents, without modifying the structure of the process itself. The task assignment problem for four types of processes are distinguished and algorithms for finding optimal solutions to them are presented: 1) a business process with a predetermined workflow, for which the optimal solution is conveniently found using the well-known Hungarian algorithm. 2) a Markovian process, for which we present an analytical method that reduces it to the first type. 3) a nonMarkovian process, for which we employ a simulation method to obtain the optimal solution. 4) the most general case, i.e. a nonMarkovian process containing critical tasks. In such processes, depending on the agents that perform critical tasks the workflow of the process may change. We introduce two algorithms for this type of processes. One that finds the optimal solution, but is feasible only when the number of critical tasks is few. The second algorithm is even applicable to large number of critical tasks but provides a near-optimal solution. In the second algorithm a hill-climbing heuristic method is combined with Hungarian algorithm and simulation to find an overall near-optimal solution for assignments of tasks to agents. The results of a series of tests that demonstrate the feasibility of the algorithms are included.

Place, publisher, year, edition, pages
IEEE Press, 2010. 1-8 p.
Keyword [en]
Business Process Model, Optimization
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-49912DOI: 10.1109/PADS.2010.5471671Scopus ID: 2-s2.0-77954121683ISBN: 978-1-4244-7292-5 (print)OAI: oai:DiVA.org:kth-49912DiVA: diva2:460616
Conference
Principles of Advanced and Distributed Simulation, PADS-2010
Note
© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. QC 20111202Available from: 2011-12-02 Created: 2011-11-30 Last updated: 2011-12-02Bibliographically approved

Open Access in DiVA

Optimizing a Business Process Model by Using Simulation(189 kB)726 downloads
File information
File name FULLTEXT01.pdfFile size 189 kBChecksum SHA-512
225b063158cd643bc8a2789264555f0623979ac3253d5ddfb1e4807f9af7675e74653adb8160c37711bfd05fff9260fa980f764a7eca2353ecfb12d8f915ec19
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEE Xplore

Search in DiVA

By author/editor
Kamrani, FarzadAyani, RassulKarimson, Anvar
By organisation
Software and Computer Systems, SCS
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 726 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 89 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf