A dynamic critical path computation algorithm for enterprise process cooperative scheduling

Download
  1. (PDF, 289 KB)
DOIResolve DOI: http://doi.org/10.1109/CSCWD.2010.5471902
AuthorSearch for: ; Search for: ; Search for: ; Search for: ; Search for:
TypeArticle
ConferenceProceedings of the 2010 14th International Conference on Computer Supported Cooperative Work in Design: 14 April 2010, Shanghai, P.R. China
ISBN9781424467631
Pages606610; # of pages: 5
SubjectCritical path, dynamic critical path selection, analytic hierarchy process, business process simulation, dynamic programming
AbstractBusiness 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.
Publication date
LanguageEnglish
AffiliationNRC Institute for Research in Construction; National Research Council Canada
Peer reviewedYes
NRC number53264
20913
NPARC number20374321
Export citationExport as RIS
Report a correctionReport a correction
Record identifier52aeebc2-e53a-4b41-8d8e-73ddf64576bc
Record created2012-07-23
Record modified2016-05-09
Bookmark and share
  • Share this page with Facebook (Opens in a new window)
  • Share this page with Twitter (Opens in a new window)
  • Share this page with Google+ (Opens in a new window)
  • Share this page with Delicious (Opens in a new window)