### Uittreksel

Taal | Engels |
---|---|

Pagina's | 429-441 |

Aantal pagina's | 13 |

Tijdschrift | IISE Transactions |

Volume | 49 |

Nummer van het tijdschrift | 4 |

Vroegere onlinedatum | 23 jan 2017 |

DOI's | |

Status | Gepubliceerd - 2017 |

### Vingerafdruk

### Citeer dit

*IISE Transactions*,

*49*(4), 429-441. DOI: 10.1080/0740817X.2016.1243281

}

*IISE Transactions*, vol. 49, nr. 4, blz. 429-441. DOI: 10.1080/0740817X.2016.1243281

**Fleet readiness: stocking spare parts and high-tech assets.** / Basten, R.J.I.; Arts, J.J.

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

TY - JOUR

T1 - Fleet readiness: stocking spare parts and high-tech assets

AU - Basten,R.J.I.

AU - Arts,J.J.

PY - 2017

Y1 - 2017

N2 - We consider a maintenance shop that is responsible for the availability of a fleet of assets; e.g., trains. Unavailability of assets may be due to active maintenance time or unavailability of spare parts. Both spare assets and spare parts may be stocked in order to ensure a certain fleet readiness, which is the probability of having sufficient assets available for the primary process (e.g., running a train schedule) at any given moment. This is different from guaranteeing a certain average availability, as is typically done in the literature on spare parts inventories. We analyze the corresponding system, assuming continuous review and base stock control. We propose an algorithm, based on a marginal analysis approach, to solve the optimization problem of minimizing holding costs for spare assets and spare parts. Since the problem is not item separable, even marginal analysis is time-consuming, but we show how to efficiently solve this problem. Using a numerical experiment, we show that our algorithm generally leads to a solution that is close to optimal and that it is much faster than an existing algorithm for a closely related problem. We further show that the additional costs that are incurred when the problem of stocking spare assets and spare parts is not solved jointly can be significant. A key managerial insight is that typically the number of spare assets to be acquired is very close to a lower bound that is determined only by the active maintenance time on the assets. It is typically not cost-effective to acquire more spare assets to cover spare parts unavailability.

AB - We consider a maintenance shop that is responsible for the availability of a fleet of assets; e.g., trains. Unavailability of assets may be due to active maintenance time or unavailability of spare parts. Both spare assets and spare parts may be stocked in order to ensure a certain fleet readiness, which is the probability of having sufficient assets available for the primary process (e.g., running a train schedule) at any given moment. This is different from guaranteeing a certain average availability, as is typically done in the literature on spare parts inventories. We analyze the corresponding system, assuming continuous review and base stock control. We propose an algorithm, based on a marginal analysis approach, to solve the optimization problem of minimizing holding costs for spare assets and spare parts. Since the problem is not item separable, even marginal analysis is time-consuming, but we show how to efficiently solve this problem. Using a numerical experiment, we show that our algorithm generally leads to a solution that is close to optimal and that it is much faster than an existing algorithm for a closely related problem. We further show that the additional costs that are incurred when the problem of stocking spare assets and spare parts is not solved jointly can be significant. A key managerial insight is that typically the number of spare assets to be acquired is very close to a lower bound that is determined only by the active maintenance time on the assets. It is typically not cost-effective to acquire more spare assets to cover spare parts unavailability.

U2 - 10.1080/0740817X.2016.1243281

DO - 10.1080/0740817X.2016.1243281

M3 - Article

VL - 49

SP - 429

EP - 441

JO - IISE Transactions

T2 - IISE Transactions

JF - IISE Transactions

SN - 2472-5854

IS - 4

ER -