Optimal Control of Single-Server Queuing Networks and Multi-Class M / G /1 Queues with Feedback

Dong-Wan Tcha and Stanley R. Pliska
Additional contact information
Dong-Wan Tcha: Korea Advanced Institute of Science, Seoul, Korea
Stanley R. Pliska: Northwestern University, Evanston, Illinois

Operations Research, 1977, vol. 25, issue 2, 248-258

Abstract: We consider a queuing network with Poisson arrivals at each node. At each service completion epoch, a reward is received and the serviced customer changes nodes or leaves the system according to specified probabilities. In addition, linear holding costs are incurred. The problem is to schedule the server so as to maximize the expected discounted reward over an infinite planning horizon. This model is equivalent to a single-server, multi-class queuing system with feedback of the customers. We study two cases: general service times with a non-preemptive service discipline and exponential service times with a preemptive service discipline. For each case we show that a modified static policy of priority form is optimal and we provide an algorithm for computing an optimal policy.

Date: 1977
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.25.2.248 (application/pdf)

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:inm:oropre:v:25:y:1977:i:2:p:248-258

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().