메뉴 건너뛰기




Volumn , Issue , 2010, Pages 48-55

Design-time process optimization through optimization patterns and process model matching

Author keywords

Business process analytics; Business process design; Business process management; Business process optimization; Process model matching

Indexed keywords

BUSINESS PROCESS; BUSINESS PROCESS DESIGN; BUSINESS PROCESS MANAGEMENT; BUSINESS PROCESS OPTIMIZATION; PROCESS MODEL MATCHING;

EID: 79952434320     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2010.9     Document Type: Conference Paper
Times cited : (18)

References (19)
  • 4
    • 12344313285 scopus 로고    scopus 로고
    • Best practices in business process redesign: An overview and qualitative evaluation of successful redesign heuristics
    • H. Reijers and S. Liman Mansar, "Best practices in business process redesign: an overview and qualitative evaluation of successful redesign heuristics," Omega, vol. 33, no. 4, pp. 283-306, 2005.
    • (2005) Omega , vol.33 , Issue.4 , pp. 283-306
    • Reijers, H.1    Liman Mansar, S.2
  • 6
    • 79952387426 scopus 로고    scopus 로고
    • Matching of process data and operational data for a deep business analysis
    • S. Radeschütz, B. Mitschang, and F. Leymann, "Matching of process data and operational data for a deep business analysis," Enterprise Interoperability III, pp. 171-182, 2008.
    • (2008) Enterprise Interoperability , vol.3 , pp. 171-182
    • Radeschütz, S.1    Mitschang, B.2    Leymann, F.3
  • 7
    • 84874250062 scopus 로고    scopus 로고
    • Extended analysis techniques for a comprehensive business process optimization
    • S. Radeschütz and B. Mitschang, "Extended analysis techniques for a comprehensive business process optimization," in Proceedings KIMS, 2009.
    • Proceedings KIMS, 2009
    • Radeschütz, S.1    Mitschang, B.2
  • 10
    • 0001116877 scopus 로고
    • Binary code capable of correcting deletions, insertions and reversals
    • I. Levenshtein, "Binary code capable of correcting deletions, insertions and reversals," Cybernetics and Control Theory, vol. 10, no. 8, pp. 707-710, 1966.
    • (1966) Cybernetics and Control Theory , vol.10 , Issue.8 , pp. 707-710
    • Levenshtein, I.1
  • 17
    • 33645894491 scopus 로고    scopus 로고
    • Flexible online association rule mining based on multidimensional pattern relations
    • C. Wang, S. Tseng, and T. Hong, "Flexible online association rule mining based on multidimensional pattern relations," Information Sciences, vol. 176, no. 12, pp. 1752-1780, 2006.
    • (2006) Information Sciences , vol.176 , Issue.12 , pp. 1752-1780
    • Wang, C.1    Tseng, S.2    Hong, T.3
  • 19
    • 0032024433 scopus 로고    scopus 로고
    • A graph distance metric based on the maximal common subgraph
    • H. Bunke and K. Shearer, "A graph distance metric based on the maximal common subgraph," Pattern recognition letters, vol. 19, no. 3-4, pp. 255-259, 1998.
    • (1998) Pattern Recognition Letters , vol.19 , Issue.3-4 , pp. 255-259
    • Bunke, H.1    Shearer, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.