A clustering-based repair shop design for repairable spare part supply systems

Hasan Hüseyin Turan, Andrei Sleptchenko, Shaligram Pokharel, Tarek Y. ElMekkawy

    Research output: Contribution to journalArticlepeer-review

    10 Scopus citations

    Abstract

    In this study, we address the design problem of a single repair shop in a repairable multi-item spare part supply system. We propose a sequential solution heuristic to solve the joint problem of resource pooling, inventory allocation, and capacity level designation of the repair shop with stochastic failure and repair time of repairables. The pooling strategies to obtain repair shop clusters/cells are handled by a K-median algorithm by taking into account the repair time and the holding cost of each repairable spare part. We find that the decomposition of the repair shop in sub-systems by clustering reduces the complexity of the problem and enables the use of queue-theoretical approximations to optimize the inventory and capacity levels. The effectiveness of the proposed approach is analyzed with several numerical experiments. The repair shop designs suggested by the approach provide around 10% and 30% cost reductions on an average when compared to fully flexible and totally dedicated designs, respectively. We also explore the impact of several input parameters and different clustering rules on the performance of the methodology and provide managerial insights.

    Original languageBritish English
    Pages (from-to)232-244
    Number of pages13
    JournalComputers and Industrial Engineering
    Volume125
    DOIs
    StatePublished - Nov 2018

    Keywords

    • Heuristic
    • K-median
    • Pooling
    • Queuing approximation
    • Repair shop
    • Spare part logistics

    Fingerprint

    Dive into the research topics of 'A clustering-based repair shop design for repairable spare part supply systems'. Together they form a unique fingerprint.

    Cite this