Author:
Shekhar Chandra,Deora Praveen,Varshney Shreekant,Singh Kunwar Pal,Sharma Dinesh Chandra
Abstract
In this article, we study machine repair problems (MRP) consisting of the finite number of operating machines with the provisioning of the finite number of warm standby machines under the care of a single unreliable server. For the machining system’s uninterrupted functioning, an operating machine is immediately replaced with the available warm standby machine in negligible switchover time whenever it fails. The concept of threshold vacation policy: N-policy is also considered. Under this vacation policy, the server starts to serve the failed machines on the accumulation of a pre-specified number of failed machines in the system. The server continues until the system is empty from the failed machines; after that, the server goes for vacation. The notion of an organizational delay, server breakdown, and repair in multiple phases is also conceptualized to build the studied model more realistic. The recursive matrix method is used to find steady-state queue size distribution, and subsequently, various system performance measures are also developed to validate the studied model. The optimal analysis has been performed to identify the critical design parameters for the governing model. The state-of-the-art of the present study is its mathematical modeling of the multi-machine stochastic problem with varied limitations and strategies. The methodology to obtain queue size distribution, optimal design parameters, is beneficial for dealing with other complex and sophisticated real-time machining problems in the service system, computer and communication system, manufacturing and production system, etc. The present problem is limited to fewer machines, which can be extended to more machines with different topologies with high computational facilities.
Publisher
International Journal of Mathematical, Engineering and Management Sciences plus Mangey Ram
Subject
General Engineering,General Business, Management and Accounting,General Mathematics,General Computer Science
Reference47 articles.
1. Alfa, A.S., & Frigui, I. (1996). Discrete N-policy single server queue with Markovian arrival process and phase-type service. European Journal of Operational Research, 88(3), 599-613.
2. Baker, K.R. (1973). A Note on operating policies for the queue M/M/1 with exponential startups. Informs, 11(1), 71-72.
3. Borthakur, A., Medhi, J., & Gohain, R. (1987). Poisson input queueing system with startup time and under control operating policy. Computers & Operations Research, 14(1), 33-40.
4. Chopra, S., Nautiyal, L., Malik, P., Ram, M., & Sharma, M.K. (2020). A non-parametric approach for survival analysis of component-based software. International Journal of Mathematical, Engineering and Management Sciences, 5(2), 309-318.
5. Choudhury, G. (1997). A Poisson queue under N-policy with a general setup time. Indian Journal of Pure and Applied Mathematics, 28(12), 1595-1608.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献