International Association of Computer Science and Information Technology(IACSIT)
Business Process Model Families (BPMF) captures all of the possible business processes that can be defined for a target domain of interest. Configuration problem which arises is defined as the problem of both, unique business process model derivation, and services selection optimally implementing the activities of the process model. There is increasing number of available services per each activity in the BPMF, with the same functionality which differentiates on QoS characteristics. The authors propose use of Genetic Algorithms (GA) as a technique which finds near optimal solution of combinatorial problems, adopt it to the problem of BPMF configuration and simulation analyze its efficiency for considering domain.