A metaheuristic approach for the configuration of business process families

Ivana Ognjanović, Bardia Mohabbati, Dragan Gašević, Ebrahim Bagheri, Marko Bošković

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

19 Citations (Scopus)

Abstract

Business process families provide an over-arching representation of the possible business processes of a target domain. They are defined by capturing the similarities and differences among the possible business processes of the target domain. To realize a business process family into a concrete business process model, the variability points of the business process family need to be bounded. The decision on how to bind these variation points boils down to the stakeholders' requirements and needs. Given specific requirements from the stakeholders, the business process family can be configured. This paper formally introduces and empirically evaluates a framework called ConfBPFM that utilizes standard techniques for identifying stakeholders' quality requirements and employs a metaheuristic search algorithm (i.e., Genetic Algorithms) to optimally configure a business process family.

Original languageEnglish
Title of host publicationProceedings - 2012 IEEE 9th International Conference on Services Computing, SCC 2012
Pages25-32
Number of pages8
DOIs
Publication statusPublished - 17 Oct 2012
Externally publishedYes
Event2012 IEEE 9th International Conference on Services Computing, SCC 2012 - Honolulu, HI, United States of America
Duration: 24 Jun 201229 Jun 2012

Conference

Conference2012 IEEE 9th International Conference on Services Computing, SCC 2012
CountryUnited States of America
CityHonolulu, HI
Period24/06/1229/06/12

Keywords

  • business process family
  • CS-AHP
  • genetic algorithms
  • nonfunctional requirements
  • optimal configuration

Cite this