Optimal policy for bulk queue with multiple types of server breakdown

Madhu Jain and Praveen Kumar Agrawal

International Journal of Operational Research, 2009, vol. 4, issue 1, 35-54

Abstract: In this paper, an unreliable server M^X/M/1 queueing system with multiple types of server breakdowns under N-policy is considered. Breakdowns occur only when the server is in busy state and each type of breakdown requires a random number of finite stages of repair. It is assumed that the lifetimes and phase repair time of the server for the individual stage are exponentially distributed. Matrix-geometric method is employed to obtain the mean queue length and other system characteristics. We perform extensive numerical experiment to demonstrate the effect of various parameters on the system performance characteristics.

Keywords: M X /M/1 queue; unreliable servers; matrix–geometric method; queue size; N-policy; multiple breakdowns; server breakdown; bulk queueing. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=21617 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:4:y:2009:i:1:p:35-54

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().