Optimal Control of a Single-Server Queue with Balking and Reneging
We consider the problem of controlling a single-server queue by turning the server on and off. In addition to a Poisson arrival process and general service-time distribution, provisions for balking and reneging are included in the models, yielding a variety of applications. Stationary optimal policies which maximize expected discounted reward over an infinite horizon are shown to have a simple critical-number characterization. Algorithms for computing the critical numbers are described.
Volume (Year): 19 (1972)
Issue (Month): 3 (November)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:19:y:1972:i:3:p:297-313. 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: (Mirko Janc)
If references are entirely missing, you can add them using this form.