In this study, we propose a scheduling analysis method of the Flexible management system using the transitive matrix. The Scheduling problem is a combination-optimization problem basically, and a complexity is increased exponentially for a size of the problem. To reduce an increase of a complexity, we define that the basic unit of concurrency (short BUC) is a set of control flows based on behavioral properties in the net. And we propose an algorithm to divide original system into some BUC. To sum up, we divide a petri net model of the Flexible management system into the basic unit of concurrency through the division algorithm using the transitive matrix. Then we apply it to the division-scheduling algorithm to find an efficient scheduling. Finally, we verify its efficiency with an example.
1. 서론
2. 관련 연구
3. 타입 패트리넷과 추이적 행렬
4. 추이적 행렬을 이용한 BUC 단위의 분할 알고리즘
5. 분할 알고리즘을 이용한 스케쥴링 알고리즘
6. 사례 연구
7. 결론