![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Abstract
We consider a single-server retrial queue with set-up time and server breakdown. There is no waiting space in front of the server, and customers who cannot occupy the server upon arrival will go into a retrial orbit and they retry independently of each other after an exponentially distributed time. To save power, the server is turned off immediately after a service if there is no customer in the orbit. If the orbit is not empty, the server will stay idle to wait a customer coming from the external or from the orbit. A newly coming customer can reactivate the off server, and the server needs some set-up time to work. The server may fail to restart. Once failed, it will be repaired immediately and the repair time is exponentially distributed. Two models are considered according to whether the server can be perfectly repaired or not. The first model is concerned with imperfect repair and the server may still fail to activate after repair. In the second model, the server is perfectly repaired. In both models, we get the explicit expressions of stationary distribution of queue length in the system. Cost minimization is studied numerically and several numerical examples are presented.
Acknowledgements
The authors would like to thank the Associate Editor and anonymous referees for their valuable comments and suggestions which improved the presentation and the quality of this paper. Thanks are also due to the anonymous referee who drew our attention to the paper of Phung-Duc (Citation2017).
Disclosure statement
No potential conflict of interest was reported by the authors.
Notes
1 To avoid the situation that the server always fails to activate, it is necessary to restrict .
2 If and
, the server is off; If
and
, the server is idle.