A DYNAMIC PROGRAMING ALGORITHM FOR TUNING CONCURRENCY OF BUSINESS PROCESSES

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

YAGHOUBI MEHDI; ZAHEDI MORTEZA; AHMADYFARD ALIREZA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: SIGNAL AND DATA PROCESSING Year:2018 | Volume:15 | Issue:2 (SERIAL 36) Page(s): 103-117

Download Full-Text

Persian Verion

View:

751

Download:

Cites:

Information Journal Paper

Title

A DYNAMIC PROGRAMING ALGORITHM FOR TUNING CONCURRENCY OF BUSINESS PROCESSES

Author(s)

YAGHOUBI MEHDI | ZAHEDI MORTEZA | AHMADYFARD ALIREZA | Issue Writer Certificate

Keywords

BUSINESS PROCESS MANAGEMENT SYSTEMSQ1

TUNING CONCURRENCY OF BUSINESS PROCESSESQ1

WORKLOAD BALANCINGQ1

DYNAMIC OPTIMIZATIONQ1

TIME COMPLEXITYQ1

Abstract

BUSINESS PROCESS MANAGEMENT SYSTEMS (BPMS) are vital complex information systems to compete in the global market and to increase economic productivity. WORKLOAD BALANCING of resources in BPMS is one of the challenges have been long studied by researchers. WORKLOAD BALANCING of resources increases the system stability, improves the efficiency of the resources and enhances the quality of their products. WORKLOAD BALANCING of resources in BPMS is considered as an important factor of the performance and the stability in systems. Setting the workload of each source at a certain level increases the efficiency of the resources. The main objectives of this research are the concept of resource workload balance and uniformity of the workload for each source at a specified level. To optimize the balance workload and uniformity of each source, the setting multi-process concurrency was offered and studied. Also, the regulation of multi-process concurrency was mentioned as an optimization problem. In this paper, tuning concurrency of the business process is introduced as a problem in BPMS, which is an application issue to improve at workload balance of resources and uniformity in the workload of each resource. To solve this problem, a delay vector is defined, each element of delay vector makes the synthetic delay at the first of each business process, then a DYNAMIC OPTIMIZATION algorithm is presented to compute delay vector and the speed of the proposed algorithms is compared with and state-space search algorithm and evolutionary algorithm of PSO. The comparison shows that the speed of the proposed algorithm is 37 hours to 5. 8 years compared to the state-space search algorithm, while the POS algorithm solves the same problem in just 3 minutes. The experimental results on a real dataset show 21. 64 percent improvement in the performance of the proposed algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

YAGHOUBI, MEHDI, ZAHEDI, MORTEZA, & AHMADYFARD, ALIREZA. (2018). A DYNAMIC PROGRAMING ALGORITHM FOR TUNING CONCURRENCY OF BUSINESS PROCESSES. SIGNAL AND DATA PROCESSING, 15(2 (SERIAL 36) ), 103-117. SID. https://sid.ir/paper/160932/en

Vancouver: Copy

YAGHOUBI MEHDI, ZAHEDI MORTEZA, AHMADYFARD ALIREZA. A DYNAMIC PROGRAMING ALGORITHM FOR TUNING CONCURRENCY OF BUSINESS PROCESSES. SIGNAL AND DATA PROCESSING[Internet]. 2018;15(2 (SERIAL 36) ):103-117. Available from: https://sid.ir/paper/160932/en

IEEE: Copy

MEHDI YAGHOUBI, MORTEZA ZAHEDI, and ALIREZA AHMADYFARD, “A DYNAMIC PROGRAMING ALGORITHM FOR TUNING CONCURRENCY OF BUSINESS PROCESSES,” SIGNAL AND DATA PROCESSING, vol. 15, no. 2 (SERIAL 36) , pp. 103–117, 2018, [Online]. Available: https://sid.ir/paper/160932/en

Related Journal Papers