Skip to main content
Log in

Optimal intensity control of a multi-class queue

  • Contributed Papers
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We study a mixed problem of optimal scheduling and input and output control of a single server queue with multi-classes of customers. The model extends the classical optimal scheduling problem by allowing the general point processes as the arrival and departure processes and the control of the arrival and departure intensities. The objective of our scheduling and control problem is to minimize the expected discounted inventory cost over an infinite horizon, and the problem is formulated as an intensity control. We find the well-known is the optimal solution to our problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P. Brémaud,Point Processes and Queues (Springer-Verlag, New York, 1981).

    Google Scholar 

  2. H. Chen and D.D. Yao, Optimal intensity control of a queueing system, to appear in IEEE Trans. Autom. Cont., 1988.

  3. D. Cox and W. Smith,Queues (Methuen, London, 1961).

    Google Scholar 

  4. J.M. Harrison, Dynamic scheduling of a multiclass queue: discount optimality, Operations Research 23 (1975) 270–282.

    Google Scholar 

  5. G.P. Klimov, “Time Sharing Service Systems I”, Theory of Probability and Its Appl. 19 (1974) 532–551.

    Google Scholar 

  6. T.L. Lai and Z. Ying, Open bandit problems and optimal scheduling of queueing networks, preprint, 1987.

  7. L. Li, A stochastic model of production firms, Math. of Operations Research (1988) to appear.

  8. P. Nain and K.W. Ross, Optimal priority assignment with hard constraint, IEEE Trans. Autom. Cont. AC-31, 10 (1986) 883–888.

    Google Scholar 

  9. K.W. Ross and D.D. Yao, Optimal dynamic scheduling in Jackson networks, IEEE Trans. Autom. Cont. AC-34, 1 (1989) 47–53.

    Google Scholar 

  10. S. Ross,Stochastic Processes (Wiley, New York, 1983).

    Google Scholar 

  11. J.G. Shanthikumar and D.D. Yao, Stochastic monotonicity of the queue lengths in closed queueing networks, Operations Research 35 (1987) 583–588.

    Google Scholar 

  12. J.G. Shanthikumar and D.D. Yao, Spatiotemporal convexity of stochastic processes and applications, preprint, 1987.

  13. D.W. Tcha and S.R. Pliska, Optimal control of single-server queueing networks and multi-class M/G/1 queues with feedback, Operations Research 25 (1977) 248–258.

    Google Scholar 

  14. P.P. Varaiya, J. Walrand and C. Buyukkoc, Extensions of the multi-armed bandit problem: the discounted case, IEEE Trans. Autom. Cont. AC-30 (1985) 426–439.

    Google Scholar 

  15. P. Whittle,Optimization over Time, Vol. I (John Wiley and Sons, New York, 1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Supported in part by NSF under grant ECS-8658157, by ONR under contract N00014-84-K-0465, and by a grant from AT&T Bell Laboratories.

The work was done while the author was a postdoctoral fellow in the Division of Applied Sciences, Harvard University, Cambridge, Massachusetts 02138.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, H. Optimal intensity control of a multi-class queue. Queueing Syst 5, 281–293 (1989). https://doi.org/10.1007/BF01225320

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01225320

Keywords

Navigation