A discrete time single-server queue with balking: economic applications
This article studies a discrete time single-server queue with finite and infinite buffer where the users have the option to leave the queue upon arrival (balking). We consider two variants of the model in accordance with the balking policies. Firstly, all the arriving customers balk with a constant probability. Secondly, arriving customers increase their balking probabilities as more customers join the system. Specifically, we find the ergodicity condition and closed-form expressions for the stationary distribution of the system size, of the waiting/spending time in the FCFS system and of the unfinished work. The mathematical model is applied in order to resolve several real-life problems in the economic field; in this sense, practical applications in the secondary and tertiary sector are shown. We also develop a cost model to determine the buffer capacity that minimizes certain cost function and give some numerical examples.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 40 (2008)
Issue (Month): 6 ()
|Contact details of provider:|| Web page: http://www.tandfonline.com/RAEC20|
|Order Information:||Web: http://www.tandfonline.com/pricing/journal/RAEC20|
When requesting a correction, please mention this item's handle: RePEc:taf:applec:v:40:y:2008:i:6:p:735-748. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Michael McNulty)
If references are entirely missing, you can add them using this form.