Abstract
A double-orbit retrial (DOR) machine repair problem under Markovian assumptions is investigated, incorporating an admission control F -policy (ACFP) and an unreliable repair-facility to serve incoming failed machines. The system has a finite capacity K and a limited machine population M , with K ≤ M . Incoming failed machines that find the repair-facility busy are directed to one of two distinct retrial orbits, each governed by a distinct retrial intensity. The ACFP helps in managing congestion from failed machines in queueing systems by halting new arrivals when the system is saturated and resuming only when failures in repair-facility falls below a predefined threshold level, F . A two-stage restoration process is available for repair-facility breakdown, allowing recovery in the first stage or, if needed, in the second. The model also incorporates a feedback mechanism wherein inadequately serviced machines re-enter the system by joining the queue for another service attempt. The system’s behavior is examined by formulating Chapman-Kolmogorov difference equations, which are then solved recursively to determine steady-state probabilities for all system states. These probabilities form the basis for evaluating the model’s key performance measures. The system’s total operational cost is constructed using relevant parameters and minimized via the quasi-Newton method to determine optimal service rates. Numerical experiments analyze the impact of parameter changes on the system’s performance measures. The practical justification of developed model is illustrated through its application to a hydraulic cylinder repair workshop, where machines like gantry cranes and launching gantries arrive for and receive service under the proposed model.
Full text
6,955 characters
· extracted from
preprint-html
· click to expand
Cost Optimization of Machine Repair Problem with Differentiated Retrials and Repair-Facility Breakdown under ACFP | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL This is a preprint and has not been peer reviewed. Data may be preliminary. 18 August 2025 V1 Latest version Share on Cost Optimization of Machine Repair Problem with Differentiated Retrials and Repair-Facility Breakdown under ACFP Authors : Sudeep Sanga and Muskaan Saini 0009-0004-2718-7191 [email protected] Authors Info & Affiliations https://doi.org/10.22541/au.175554202.23314125/v1 199 views 172 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract A double-orbit retrial (DOR) machine repair problem under Markovian assumptions is investigated, incorporating an admission control F -policy (ACFP) and an unreliable repair-facility to serve incoming failed machines. The system has a finite capacity K and a limited machine population M , with K ≤ M . Incoming failed machines that find the repair-facility busy are directed to one of two distinct retrial orbits, each governed by a distinct retrial intensity. The ACFP helps in managing congestion from failed machines in queueing systems by halting new arrivals when the system is saturated and resuming only when failures in repair-facility falls below a predefined threshold level, F . A two-stage restoration process is available for repair-facility breakdown, allowing recovery in the first stage or, if needed, in the second. The model also incorporates a feedback mechanism wherein inadequately serviced machines re-enter the system by joining the queue for another service attempt. The system’s behavior is examined by formulating Chapman-Kolmogorov difference equations, which are then solved recursively to determine steady-state probabilities for all system states. These probabilities form the basis for evaluating the model’s key performance measures. The system’s total operational cost is constructed using relevant parameters and minimized via the quasi-Newton method to determine optimal service rates. Numerical experiments analyze the impact of parameter changes on the system’s performance measures. The practical justification of developed model is illustrated through its application to a hydraulic cylinder repair workshop, where machines like gantry cranes and launching gantries arrive for and receive service under the proposed model. Supplementary Material File (main document - latex pdf.pdf) Download 4.42 MB Information & Authors Information Version history V1 Version 1 18 August 2025 Copyright This work is licensed under a Non Exclusive No Reuse License. Keywords f-policy cost double-orbit hcrw machine repair problem two-stage restoration Authors Affiliations Sudeep Sanga Sardar Vallabhbhai National Institute of Technology View all articles by this author Muskaan Saini 0009-0004-2718-7191 [email protected] Sardar Vallabhbhai National Institute of Technology View all articles by this author Metrics & Citations Metrics Article Usage 199 views 172 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation Sudeep Sanga, Muskaan Saini. Cost Optimization of Machine Repair Problem with Differentiated Retrials and Repair-Facility Breakdown under ACFP. Authorea . 18 August 2025. DOI: https://doi.org/10.22541/au.175554202.23314125/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.175554202.23314125/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9fece166ccbb58f4',t:'MTc3OTI5NjI0Ng=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.