Defining line replaceable units

Research output: Contribution to journalArticleAcademicpeer-review

2 Citations (Scopus)

Abstract

Defective capital assets may be quickly restored to their operational condition by replacing the item that has failed. The item that is replaced is called the Line Replaceable Unit (LRU), and the so-called LRU definition problem is the problem of deciding on which item to replace upon each type of failure: when a replacement action is required in the field, service engineers can either replace the failed item itself or replace a parent assembly that holds the failed item. One option may be fast but expensive, while the other may take longer but against lower cost. We consider a maintenance organization that services a fleet of assets, so that unavailability due to maintenance downtime may be compensated by acquiring additional standby assets. The objective of the LRU-definition problem is to minimize the total cost of item replacement and the investment in additional assets, given a constraint on the availability of the fleet of assets. We link this problem to the literature. We also present two cases to show how the problem is treated in practice. We next model the problem as a mixed integer linear programming formulation, and we use a numerical experiment to illustrate the model, and the potential cost reductions that using such a model may lead to.
Original languageEnglish
Pages (from-to)310-320
JournalEuropean journal of operational research
Volume247
Issue number1
DOIs
Publication statusPublished - 2015

Fingerprint

Unit
Line
Cost reduction
Linear programming
Replacement
Costs
Maintenance
Availability
Engineers
Mixed Integer Linear Programming
Assets
Experiments
Numerical Experiment
Model
Minimise
Formulation

Keywords

  • METIS-311425
  • IR-96974

Cite this

@article{a03e1772cf944e05bc0fc7d798f8fb13,
title = "Defining line replaceable units",
abstract = "Defective capital assets may be quickly restored to their operational condition by replacing the item that has failed. The item that is replaced is called the Line Replaceable Unit (LRU), and the so-called LRU definition problem is the problem of deciding on which item to replace upon each type of failure: when a replacement action is required in the field, service engineers can either replace the failed item itself or replace a parent assembly that holds the failed item. One option may be fast but expensive, while the other may take longer but against lower cost. We consider a maintenance organization that services a fleet of assets, so that unavailability due to maintenance downtime may be compensated by acquiring additional standby assets. The objective of the LRU-definition problem is to minimize the total cost of item replacement and the investment in additional assets, given a constraint on the availability of the fleet of assets. We link this problem to the literature. We also present two cases to show how the problem is treated in practice. We next model the problem as a mixed integer linear programming formulation, and we use a numerical experiment to illustrate the model, and the potential cost reductions that using such a model may lead to.",
keywords = "METIS-311425, IR-96974",
author = "{Parada Puig}, J.E. and Basten, {Robertus Johannes Ida}",
year = "2015",
doi = "10.1016/j.ejor.2015.05.065",
language = "English",
volume = "247",
pages = "310--320",
journal = "European journal of operational research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

Defining line replaceable units. / Parada Puig, J.E.; Basten, Robertus Johannes Ida.

In: European journal of operational research, Vol. 247, No. 1, 2015, p. 310-320.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Defining line replaceable units

AU - Parada Puig, J.E.

AU - Basten, Robertus Johannes Ida

PY - 2015

Y1 - 2015

N2 - Defective capital assets may be quickly restored to their operational condition by replacing the item that has failed. The item that is replaced is called the Line Replaceable Unit (LRU), and the so-called LRU definition problem is the problem of deciding on which item to replace upon each type of failure: when a replacement action is required in the field, service engineers can either replace the failed item itself or replace a parent assembly that holds the failed item. One option may be fast but expensive, while the other may take longer but against lower cost. We consider a maintenance organization that services a fleet of assets, so that unavailability due to maintenance downtime may be compensated by acquiring additional standby assets. The objective of the LRU-definition problem is to minimize the total cost of item replacement and the investment in additional assets, given a constraint on the availability of the fleet of assets. We link this problem to the literature. We also present two cases to show how the problem is treated in practice. We next model the problem as a mixed integer linear programming formulation, and we use a numerical experiment to illustrate the model, and the potential cost reductions that using such a model may lead to.

AB - Defective capital assets may be quickly restored to their operational condition by replacing the item that has failed. The item that is replaced is called the Line Replaceable Unit (LRU), and the so-called LRU definition problem is the problem of deciding on which item to replace upon each type of failure: when a replacement action is required in the field, service engineers can either replace the failed item itself or replace a parent assembly that holds the failed item. One option may be fast but expensive, while the other may take longer but against lower cost. We consider a maintenance organization that services a fleet of assets, so that unavailability due to maintenance downtime may be compensated by acquiring additional standby assets. The objective of the LRU-definition problem is to minimize the total cost of item replacement and the investment in additional assets, given a constraint on the availability of the fleet of assets. We link this problem to the literature. We also present two cases to show how the problem is treated in practice. We next model the problem as a mixed integer linear programming formulation, and we use a numerical experiment to illustrate the model, and the potential cost reductions that using such a model may lead to.

KW - METIS-311425

KW - IR-96974

U2 - 10.1016/j.ejor.2015.05.065

DO - 10.1016/j.ejor.2015.05.065

M3 - Article

VL - 247

SP - 310

EP - 320

JO - European journal of operational research

JF - European journal of operational research

SN - 0377-2217

IS - 1

ER -