Journal Published Online: 01 September 2012
Volume 40, Issue 6

Optimization Analysis of the Machine Repair Problem with Balking and Variable Number of Servers



This paper analyzes the machine repair problem with a variable number of servers in which failed machines balk (do not enter) with a constant probability. Failure and repair times of the failed machines are assumed to be exponentially distributed. We apply a recursive method to derive analytic steady-state solutions, through which several system performance measures can be obtained. A cost model is developed to determine the optimal maximum number of busy servers and the optimal value of the balking probability. We use the direct search method and the Newton’s method to find the minimum cost until the balking constraint is satisfied. Numerical results provided in which various system performance measures are evaluated under optimal operating conditions. Finally, an application example is provided to demonstrate how the queueing model could be used in real-life situations.

Author Information

Wang, Kuo-Hsiung
Dept. of Computer Science and Information Management, Providence Univ., Taichung, TW
Liou, Yuh-Ching
Dept. of Applied Mathematics, National Chung-Hsing Univ., Taichung, TW
Yang, Dong-Yuh
Institute of Information and Decision Sciences, National Taipei College of Business, Taipei, TW
Pages: 9
Price: $25.00
Reprints and Permissions
Reprints and copyright permissions can be requested through the
Copyright Clearance Center
Stock #: JTE104529
ISSN: 0090-3973
DOI: 10.1520/JTE104529