기지간 이동이 있는 수리가능재고 시스템에 대한 해법

Abstract

기지간 이동이 있는 수리가능재고 시스템에서 효율적인 재고정책을 제시하는 알고리듬 개발에 관한 연구임.

This paper concerns the problem to determine the optimal spare inventory level for a repairable-item inventory system. When an item fails, the failed item is replaced immediately if a spare is available at the base. If there is no spare item available at the base, it is requested as a lateral transshipment to another base that has a stock on hand. If an item is available in none of the bases, the item is backordered until a spare becomes available. We propose an algorithm to find the optimal spare inventory level at each base, which minimizes the total expected cost of the system. The algorithm is illustrated using examples of various sizes.