 A study on M X / G ( a, b )/ 1 queue with server breakdown without interruption and controllable arrivals during multiple adaptive vacationsS. Jeyakumar and E. Rameshkumar International Journal of Mathematics in Operational Research, 2019, vol. 15, issue 2, 137-155 Abstract: A single server model, after completion of a bulk service, if there is no breakdown with probability (1 − ψ) and queue length (queue) ≥ 'a', then the bulk service continues, otherwise, the server performs closedown work is analysed. At the end of bulk service, if there is a breakdown occurs with probability (ψ), then the server performs renovation process. After that, if the queue is ≥ 'a', then he performs bulk service otherwise the server perform closedown work follows a vacation. After that, if the queue is less than 'a', then he takes at most 'M' vacations successively. After 'M' vacations, if the queue is still less than 'a', then he remains in the system. However, the customers enter the service station with probability 'p' (0 ≤ p ≤ 1) during multiple adaptive vacations. The probability generating function (PGF) of queue size and performance measures are obtained and cost model is developed. Keywords: multiple adaptive vacation; closedown times; server breakdown; renovation times; controllable arrival; queue; bulk service; supplementary variables; dormant period; probability generating function; PGF. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:15:y:2019:i:2:p:137-155 Access Statistics for this article More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.