Integer goal programming approach for finding a compromise allocation of repairable components

  • Ali I
  • Raghav Y
  • Bari A
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

The selection problem of repairable components for a system is a kind of reliability optimization problem and is often treated as a single objective problem with the goal of maximizing the system reliability (or minimizing either time or cost spent on repairing the component). In the present paper, we formulated the selection problem of repairable components for a parallelseries system as a multi-objective optimization problem and have discussed two different models. In the first model, the reliability of subsystems are considered as different objectives. In second model the cost and time spent on repairing the components are considered as two different objectives. Selective maintenance operation is used to select the repairable components and a multi-objective goal programming algorithm is proposed to obtain compromise selection of repairable components for the two models under some given constraints. A numerical example is given to illustrate the procedure.

Cite

CITATION STYLE

APA

Ali, I., Raghav, Y., & Bari, A. (1970). Integer goal programming approach for finding a compromise allocation of repairable components. International Journal of Engineering, Science and Technology, 3(6), 184–195. https://doi.org/10.4314/ijest.v3i6.15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free