Browse

Dynamic execution planning for reliable collaborative business processes

Cited 9 time in Web of Science Cited 11 time in Scopus
Authors
Oh, Jeyeon; Cho, Nam Wook; Kim, Hoontae; Min, Yunhong; Kang, Suk-Ho
Issue Date
2011-01-15
Publisher
ELSEVIER SCIENCE INC
Citation
INFORMATION SCIENCES; Vol.181 2; 351-361
Keywords
Collaborative business processQoS of web servicesWeb serviceQuality of serviceWorkflowFault-tolerance
Abstract
Collaborative business processes, implemented and carried out via web services and enabling dynamic interaction among organizations, are becoming more indispensable to competitiveness in the global market. As dynamic collaboration prevails, the quality of service (QoS) of collaborative processes becomes more important. A critical requirement in cases where processes involve long-term activities is to guarantee successful completion within time constraints. In this study, we developed a methodology for dynamic planning of web service execution that imparts reliability to collaborative business processes. In order to ensure that processes successfully execute within time constraints and at minimum cost, the proposed method dynamically modifies execution plans at run-time by means of fault-tolerance techniques. Since generation of an execution plan of minimum cost while guaranteeing successful completion is classified as an NP-hard problem, a heuristic algorithm was developed. Additionally, to compare the proposed algorithm''''''''s performance with those of the branch-and-bound method and the genetic algorithm (GA), a set of experiments was conducted. (C) 2010 Elsevier Inc. All rights reserved.
ISSN
0020-0255
Language
English
URI
http://hdl.handle.net/10371/74932
DOI
https://doi.org/10.1016/j.ins.2010.09.019
Files in This Item:
There are no files associated with this item.
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Industrial Engineering (산업공학과)Journal Papers (저널논문_산업공학과)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse