IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v57y2019i13p4098-4117.html
   My bibliography  Save this article

Optimal joint selective imperfect maintenance and multiple repairpersons assignment strategy for complex multicomponent systems

Author

Listed:
  • Claver Diallo
  • Uday Venkatadri
  • Abdelhakim Khatab
  • Zhuojun Liu
  • El-Houssaine Aghezzaf

Abstract

This paper addresses the joint selective maintenance and repairperson assignment problem (JSM–RAP) for complex multicomponent systems. The systems perform consecutive missions separated by scheduled finite duration breaks and are imperfectly maintained during the breaks. Current selective maintenance (SM) models usually assume that only one repair channel is available or that the repairperson assignment optimisation can be done at a subsequent stage. Using a generalised reliability function for k-out-of-n systems, we formulate the JSM–RAP for multicomponent systems more complex than the series-parallel systems commonly used in previous SM models. Two nonlinear formulations and their corresponding binary integer programming models are then proposed and optimally solved. Numerical experiments show the added value of the proposed approach and highlight the benefit of jointly carrying out the selection of the components to be maintained, the maintenance level to be performed and the assignment of the maintenance tasks to repairpersons. It is also shown that the flexibility provided by mixed skill cohorts of repairpersons over uniform cohorts can yield higher performance levels when the skillsets are significantly different.

Suggested Citation

  • Claver Diallo & Uday Venkatadri & Abdelhakim Khatab & Zhuojun Liu & El-Houssaine Aghezzaf, 2019. "Optimal joint selective imperfect maintenance and multiple repairpersons assignment strategy for complex multicomponent systems," International Journal of Production Research, Taylor & Francis Journals, vol. 57(13), pages 4098-4117, July.
  • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:13:p:4098-4117
    DOI: 10.1080/00207543.2018.1505060
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1505060
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2018.1505060?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 search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Liu, Lujie & Yang, Jun & Kong, Xuefeng & Xiao, Yiyong, 2022. "Multi-mission selective maintenance and repairpersons assignment problem with stochastic durations," Reliability Engineering and System Safety, Elsevier, vol. 219(C).
    2. Ghorbani, Milad & Nourelfath, Mustapha & Gendreau, Michel, 2022. "A two-stage stochastic programming model for selective maintenance optimization," Reliability Engineering and System Safety, Elsevier, vol. 223(C).
    3. A. Khatab & C. Diallo & E.-H. Aghezzaf & U. Venkatadri, 2022. "Optimization of the integrated fleet-level imperfect selective maintenance and repairpersons assignment problem," Journal of Intelligent Manufacturing, Springer, vol. 33(3), pages 703-718, March.
    4. Chaabane, K. & Khatab, A. & Diallo, C. & Aghezzaf, E.-H. & Venkatadri, U., 2020. "Integrated imperfect multimission selective maintenance and repairpersons assignment problem," Reliability Engineering and System Safety, Elsevier, vol. 199(C).
    5. Yin, Mingang & Liu, Yu & Liu, Shuntao & Chen, Yiming & Yan, Yutao, 2023. "Scheduling heterogeneous repair channels in selective maintenance of multi-state systems with maintenance duration uncertainty," Reliability Engineering and System Safety, Elsevier, vol. 231(C).
    6. Xia, Tangbin & Si, Guojin & Shi, Guo & Zhang, Kaigan & Xi, Lifeng, 2022. "Optimal selective maintenance scheduling for series–parallel systems based on energy efficiency optimization," Applied Energy, Elsevier, vol. 314(C).
    7. Hamzea Al-Jabouri & Ahmed Saif & Claver Diallo, 2023. "Robust selective maintenance optimization of series–parallel mission-critical systems subject to maintenance quality uncertainty," Computational Management Science, Springer, vol. 20(1), pages 1-31, December.
    8. Ghorbani, Milad & Nourelfath, Mustapha & Gendreau, Michel, 2024. "Stochastic programming for selective maintenance optimization with uncertainty in the next mission conditions," Reliability Engineering and System Safety, Elsevier, vol. 241(C).

    More about this item

    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:taf:tprsxx:v:57:y:2019:i:13:p:4098-4117. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.