Cost optimisation and maximum entropy analysis of a bulk queueing system with breakdown, controlled arrival and multiple vacations

R.P. Nithya and M. Haridass

International Journal of Operational Research, 2020, vol. 39, issue 3, 279-305

Abstract: This article analyses a bulk queueing system with multiple vacations, controlled arrival and breakdown. The service is done in bulk with a minimum of 'a' customers and a maximum of 'b' customers. The server is assigned for secondary jobs (vacations) repeatedly when the number of customers is inadequate to process. The arrivals are accepted with a probability α, β and γ during the busy, vacation and renovation period respectively. During a batch service, if the server breaks down with probability π, the service for the particular batch is processed without interruption. Upon completion of service, the renovation of service station will be considered. The probability generating function for the queue size at an arbitrary time epoch is derived. Various performance measures are obtained. A few particular cases are discussed. Maximum entropy analysis is carried out and validated through numerical illustration. The cost model is also developed to optimise the cost.

Keywords: bulk arrival; batch service; multiple vacations; breakdown; controlled arrival; maximum entropy principle; MEP. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=110476 (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:39:y:2020:i:3:p:279-305

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 ().