Maintenance in Single-Server Queues: A Game-Theoretic Approach

Najeeb Al-Matar and Jewgeni H. Dshalalow

Mathematical Problems in Engineering, 2009, vol. 2009, 1-23

Abstract:

We use antagonistic stochastic games and fluctuation analysis to examine a single-server queue with bulk input and secondary work during server's multiple vacations. When the buffer contents become exhausted the server leaves the system to perform some diagnostic service of a minimum of jobs clustered in packets of random sizes (event A). The server is not supposed to stay longer than units of time (event B). The server returns to the system when A or B occurs, whichever comes first. On the other hand, he may not break service of a packet in a middle even if A or B occurs. Furthermore, the server waits for batches of customers to arrive if upon his return the queue is still empty. We obtain a compact and explicit form functional for the queueing process in equilibrium.

Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2009/857871.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2009/857871.xml (text/xml)

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:hin:jnlmpe:857871

DOI: 10.1155/2009/857871

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().