IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v332y2026i3p840-856.html

A bi-objective Markov decision process design approach to redundancy allocation with dynamic maintenance for a parallel system

Author

Listed:
  • Fairley, Luke
  • Shone, Rob
  • Jacko, Peter
  • Huang, Jefferson

Abstract

The reliability of a system can be improved by the addition of redundant elements, giving rise to the well-known redundancy allocation problem (RAP). We propose a novel extension to the RAP called the bi-objective integrated design and dynamic maintenance problem (BO-IDDMP) which allows for future dynamic maintenance decisions to be incorporated. This leads to a problem with first-stage redundancy design decisions and second-stage sequential maintenance decisions under uncertainty. To the best of our knowledge, this is the first use of a continuous-time Markov Decision Process (MDP) Design framework to formulate a problem with non-trivial dynamics, as well as its first use alongside bi-objective optimization. A general heuristic optimization methodology for bi-objective MDP Design problems is developed, and then applied to the BO-IDDMP. The efficiency and accuracy of our methodology are demonstrated against an exact mixed-integer linear programming solver. The heuristic is shown to be orders of magnitude faster in the majority of cases, and in only 2 out of 84 cases produces a solution that is dominated by the exact method. The inclusion of dynamic maintenance policies is shown to yield stronger and better-populated Pareto fronts, allowing more flexibility for the decision-maker. The impacts of varying parameters unique to our problem are also investigated.

Suggested Citation

  • Fairley, Luke & Shone, Rob & Jacko, Peter & Huang, Jefferson, 2026. "A bi-objective Markov decision process design approach to redundancy allocation with dynamic maintenance for a parallel system," European Journal of Operational Research, Elsevier, vol. 332(3), pages 840-856.
  • Handle: RePEc:eee:ejores:v:332:y:2026:i:3:p:840-856
    DOI: 10.1016/j.ejor.2025.12.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725009774
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2025.12.010?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:332:y:2026:i:3:p:840-856. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.