Volume 43, Number 1, January-March 2009
|Page(s)||35 - 54|
|Published online||28 January 2009|
Machine Repair Problem in Production Systems with Spares and Server Vacations
Department of Applied Statistics, National Taichung Institute of Technology, No. 129, Sec. 3, Sanmin Rd., Taichung 404, Taiwan, R.O.C.; email@example.com
2 Department of Accounting, National Taichung Institute of Technology, Taichung 404, Taiwan, R.O.C.
Accepted: 4 September 2008
This paper studies the machine repair problem consisting of M operating machines with S spare machines, and R servers (repairmen) who leave for a vacation of random length when there are no failed machines queuing up for repair in the repair facility. At the end of the vacation the servers return to the repair facility and operate one of three vacation policies: single vacation, multiple vacation, and hybrid single/multiple vacation. The Markov process and the matrix-geometric approach are used to develop the steady-state probabilities of the number of failed machines in the system as well as the performance measures. A cost model is developed to obtain the optimal values of the number of spares and the number of servers while maintaining a minimum specified level of system availability. Some numerical experiments are performed and some conclusions are drawn.
Mathematics Subject Classification: 60K25 / 90B22
Key words: Hybrid multiple/single vacation / machine repair problem / matrix-geometric approach / multiple vacations / single vacation.
© EDP Sciences, ROADEF, SMAI, 2009
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.