Due to the complexity of part flow and limited resources, FMS(Flexible Manufacturing System) develops blocking, starvation and deadlock problems, which reduce its performance. In order to minimize such problems buffers are imposed between workstations of the manufacturing lines. In this paper, we are concerned with finding the optimal buffer allocation with regard to maximizing system throughput in limited total buffer capacity situation of FMS. A dynamic programming algorithm solve the buffer allocation problem is proposed. Computer simulation using Arena is experimented to show the validation of the proposed algorithm.
1. 서론
2. 버퍼의 개념 및 기존 연구
3. 문제의 개요
4. Deadlock과 Workload를 고려한 최적 버퍼 할당
5. 수리적 예제
6. 결론 및 향후 연구 과제
참고문헌