Finding the Workflow Critical Path in the Extended Structural Workflow Schema

확장된 구조적 워크플루우 스키마에서 워크플로우 임계 경로의 결정

  • Son, Jin-Hyeon (Dept. of Electronic Computer Science, Korea Advanced Institute of Science and Technology) ;
  • Kim, Myeong-Ho (Dept. of Electronic Computer Science, Korea Advanced Institute of Science and Technology)
  • 손진현 (한국과학기술원 전자전산학과) ;
  • 김명호 (한국과학기술원 전자전산학과)
  • Published : 2002.04.01

Abstract

The concept of the critical path in the workflow is important because it can be utilized In many issues in workflow systems, e.g., workflow resource management and workflow time management. However, the critical path in the contest of the workflow has not been much addressed in the past. This is because control flows in the workflow, generally including sequence, parallel, alternative, iteration and so on, are much more complex than those in the ordinary graph or network. In this paper we first describe our workflow model that has considerable work(low control constructs. They would provide the sufficient expressive power for modeling the growing complexities of today's most business processes. Then, we propose a method to systematically determine the critical path in a workflow schema built by the workflow control constructs described in our workflow model.

워크플로우에서 임계 경로의 개념은 워크플로우 자원 및 시간 관리 등과 같이 워크플로우의 여러 분야에서 유용하게 활용될 수 있다는 면에서 중요하다. 그럼에도 불구하고 지금까지 임계 경로에 대한 연구가 많이 이루어지지 않았다. 이는 워크플로우에서의 제어 흐름 구조는 기존의 전형적인 그래프 혹은 네트워크 보다 더 복잡한 구조를 가지고 있기 때문이다. 본 논문에서는 먼저 복잡한 업무 흐름을 워크플로우로 표현할 수 있도록 지원하는 다양한 워크플로우 제어 구성 자들을 정의한다. 그리고 이를 기반으로 정의된 구조적 워크플로우 스키마에서 임계 경로를 결정하는 방법을 제안한다.

Keywords

References

  1. Lawrence, P., Workflow Handbook 1997, John Wiley & Sons Ltd., 1997
  2. Eder, J., Panagos, E., Rabinovich, M., 'Time Constraints in Workflow Systems,' Conference on Advanced Information Systems Engineering, 1999
  3. Panagos, E. and Rabinovich, M., 'Reducing Escalation-Related Costs in WFMSs,' In Proceedings of the NATO Advanced Study Institute on Workflow Management Systems and Interoperability, 1997
  4. Son, J. H. and Kim, M. H., 'Improving the Performance of Time-Constrained Workflow Processing,' Journal of Systems and Software, Vol.58/3, pp.209-217, Sep 2001 https://doi.org/10.1016/S0164-1212(01)00039-5
  5. Son, J. H., Kim, J. H., and Kim, M. H., 'Hard/Soft Deadline Assignment for High Workflow Throughput,' In Proceedings of the 1999 International Symposium on Database Applications in Non-Traditional Environments, 1999 https://doi.org/10.1109/DANTE.1999.844980
  6. Taha, H. A., Operations Research, Macmillan Publishing Company, 1992
  7. Oh, S. K., Son, J. H, LEE, Y. J., and Kim, M. H., 'An Efficient Method for Allocating Workflow Tasks to Improve the Performance of Distributed Workflows,' International Conference on Computer Science and Informatics, 2000
  8. Pozewaunig, H., Eder, J., Liebhart, W., 'ePERT: Extending PERT for workflow management systems,' The 1st European Symposium in ADBIS, 1997
  9. Heinl, P., 'Exceptions during workflow execution,' In Proceedings of the Sixth International Conference on Extending Database Technology, 1998
  10. Hagen, C. and Alonso, G., 'Flexible exception handling in the Opera process support system,' In Proceedings of the 18th IEEE International Conference on Distributed Computing Systems, 1998 https://doi.org/10.1109/ICDCS.1998.679803
  11. Panagos, E. and Rabinovich, M., 'Predictive Workflow Management,' The 3th International Workshop on NGITS, 1997
  12. Kao, B. and Garcia-Molina, H., 'Deadline assignment in a distributed soft real-time system,' In Proceedings of the 13th International Conference on Distributed Computing Systems, 1993 https://doi.org/10.1109/ICDCS.1993.287682
  13. Wolff, R. W., Stochastic Modeling and the Theory of Queues, Prentice Hall, 1989
  14. Disney, R. L., 'Queueing Networks,' American Mathematical Society Proceedings of Symposium in Applied Mathematics, 1981