The analysis of the cyclic scheduling problem in FMS using the transitive matrix has been proposed. Since the transitive matrix may explain all the relations between the places and transitions, we propose an algorithm to get good solution after slicing off some subnets from the original net based on machines operations. For analyzing the schedule problem, we considered two time functions such as produce time and waiting time using the P-invariant. In addition, we are shown the effectiveness of proposed algorithm after comparing with unfolding algorithms.
1. 서론
2. 타임패트리 넬과 추이적 행렬
3. 분할 모델 알고리즘
4. 추이적 행렬을 이용한 유연생산시스템의 스케쥴링 분석
5. 결론 및 앞으로의 연구 방향
참고문헌