IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v237y2025icp42-69.html
   My bibliography  Save this article

N-policy for redundant machining system with double retrial orbits using soft computing techniques

Author

Listed:
  • Singh, Vijay Pratap
  • Jain, Madhu
  • Sharma, Richa

Abstract

The present study is concerned with the performance prediction of a double retrial orbit redundant repairable machining system. Both primary and secondary orbits are available as waiting/buffer space for the failed units. In these orbits, the failed units can reside and make re-attempts for the repair. As per N-policy, if there are no units in the orbits for the repairing job, the repairman goes on vacation and further starts the repair job when N-failed units are accumulated. The objective of this investigation is to evaluate the transient and steady-state distributions of the queue length of failed units under N-policy. The matrix analytic and matrix recursive methods are utilized for solution purpose while an adaptive neuro-fuzzy inference system (ANFIS) is employed for validating the feasibility of designing the AI-based controller. The harmonic search (HS) and particle swarm optimization (PSO) methods have been implemented for the cost optimization purpose so as to evaluate the optimal design parameters. The outputs of study provides critical insights into optimal system performance and improving the repair policy. Furthermore, a practical application of this investigation is demonstrated in a telecommunications network traffic system, where the proposed methods can be utilized to manage the maintenance issues of routers in the network traffic.

Suggested Citation

  • Singh, Vijay Pratap & Jain, Madhu & Sharma, Richa, 2025. "N-policy for redundant machining system with double retrial orbits using soft computing techniques," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 237(C), pages 42-69.
  • Handle: RePEc:eee:matcom:v:237:y:2025:i:c:p:42-69
    DOI: 10.1016/j.matcom.2025.04.025
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.matcom.2025.04.025?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:matcom:v:237:y:2025:i:c:p:42-69. 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.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.