Dear users,
This is our new website
(we are launching the new one in order to improve our communication and provide better services to the editors and authors. So we will upload all data soon).
Please click here to visit our current website, and also to submit your paper: www.ijsom.com
Thanks for your patience during relocation.
Feel free to contact us via info@ijsom.comand ijsom.info@gmail.com
1- School of Mathematics & Software Science, Sichuan Normal University, Chengdu, Sichuan, 610068, China , wwqing0704@swust.edu.cn 2- School of Mathematics & Software Science, Sichuan Normal University, Chengdu, Sichuan, 610068, China 3- School of Science, Sichuan University of Science and Engineering, Zigong, Sichuan, 643000, China
Abstract: (14199 Views)
This paper studies an M/G/1 repairable queueing system with multiple vacations and N-policy, in which the service station is subject to occasional random breakdowns. When the service station breaks down, it is repaired by a repair facility. Moreover, the repair facility may fail during the repair period of the service station. The failed repair facility resumes repair after completion of its replacement. Under these assumptions, applying a simple method, the probability that the service station is broken, the rate of occurrence of breakdowns of the service station, the probability that the repair facility is being replaced and the rate of occurrence of failures of the repair facility along with other performance measures are obtained. Following the construction of the long-run expected cost function per unit time, the direct search method is implemented for determining the optimum threshold N* that minimises the cost function.
Wu W, Tang Y, Yu M. Analysis of an M/G/1 Queue with Multiple Vacations, N-policy, Unreliable Service Station and Repair Facility Failures. Journal title 2014; 1 (1) :1-19 URL: http://ijsom.khu.ac.ir/article-1-1900-en.html