Home
Scholarly Works
A dynamic critical path computation algorithm for...
Conference

A dynamic critical path computation algorithm for enterprise process cooperative scheduling

Abstract

Business process simulation plays an important role for enterprise business process re-engineering. This paper proposes a new algorithm to dynamically select a critical path with multiple constraints for enterprise process cooperative scheduling within cooperative business simulation systems. The proposed algorithm is based on Dynamic Programming and Analytic Hierarchy Process (AHP), and has been validated through a prototype implementation with case studies.

Authors

Yang F; Tan W; Shen W; Ghenniwa HH; Xue Y

Pagination

pp. 606-610

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Publication Date

April 1, 2010

DOI

10.1109/cscwd.2010.5471902

Name of conference

The 2010 14th International Conference on Computer Supported Cooperative Work in Design
View published work (Non-McMaster Users)

Contact the Experts team