International Journal of Engineering, Science and Technology

The AJOL site is currently undergoing a major upgrade, and there will temporarily be some restrictions to the available functionality.
-- Users will not be able to register or log in during this period.
-- Full text (PDF) downloads of Open Access journal articles will be available as always.
-- Full text (PDF) downloads of subscription based journal articles will NOT be available
We apologise for any inconvenience caused. Please check back soon, as we will revert to usual policy as soon as possible.

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

I Ali, YS Raghav, A Bari


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.

AJOL African Journals Online