کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
508795 865445 2016 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A novel flexible activity refinement approach for improving workflow process flexibility
ترجمه فارسی عنوان
رویکرد بازشناسایی فعالیت انعطاف پذیر جدید برای بهبود انعطاف پذیری روند گردش کار
کلمات کلیدی
گردش کار انعطاف پذیر؛ بازشناسایی فعالیت انعطاف پذیر؛ محدودیت زمانی. تولید گردش کار؛ فرآیند کسب و کار پویا
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی


• A novel dynamic refinement approach integrated with constraints and contexts is proposed.
• Refinement principles & rules based on five defined refinement methods are proposed.
• ARG & refinement cost are presented to find the potential optimal refinement path.
• As a further implementation, a general refinement algorithm is described.
• The results of a case study and the prototype system indicate the effectiveness.

Flexible activity refinement plays an important role in improving process flexibility and addressing uncertainties of business processes. However, it is still a challenge to refine flexible activities, and the existing researches on flexible activity refinement such as the refinement principles and methods, and their combination with factors such as constraints and contexts is still lacking. Aiming at this, a novel dynamic refinement approach for flexible activities is proposed, which combines both vertical decomposition and horizontal extension refinements, with the impact of constraints and contexts considered. In particular, we summarize five typical refinement categories, and present a set of activity refinement rules based on them. Furthermore, the decomposition refinement, including the activity decomposition principles, the related rules for trigger event delivering and execution condition transferring is discussed in detail. The extension refinement, which realizes the horizontal refinement, can be integrated with other kinds of refinement and uses constraints to specify activity selection, activity temporal relationships, etc. Then, a tree-like activity refinement graph (ARG) is proposed to represent the refinement process, based on which the refinement cost and refinement degree can be computed to benefit the finding of the potential optimal refinement path. As a further implementation of the proposed refinement approach, a general refinement algorithm is described. Finally, a case study of urolithiasis therapy process and its application are given, and the results indicate the effectiveness of our proposals.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers in Industry - Volume 80, August 2016, Pages 1–15
نویسندگان
, , , ,