Optimal control of an M/H k /1 queueing system with a removable server

Kuo-Hsiung Wang and Kuo-Liang Yen

Mathematical Methods of Operations Research, 2003, vol. 57, issue 2, 255-262

Abstract: This paper studies a single removable server queueing system with Poisson arrivals and k-type hyper-exponential service time distribution operating under the N-policy. The server may be turned on at arrival epochs or off at departure epochs. We show that the probability that the server is busy in the steady-state is equal to ∑ i=1 k q i ρ i . Various system performance measures, such as the expected number of customers in the system, the expected waiting time in the queue, and the expected waiting time in the system are obtained. A total expected cost function per unit time is developed to determine the optimal operating N-policy at minimum cost. Copyright Springer-Verlag Berlin Heidelberg 2003

Keywords: Key words: control; cost; k-type hyper-exponential; queue (search for similar items in EconPapers)
Date: 2003
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s001860200263 (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:spr:mathme:v:57:y:2003:i:2:p:255-262

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/s001860200263

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().