Skip to main content
Log in

Optimal Open-Loop Control of Vacations, Polling and Service Assignment

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

We consider in this paper the optimal open-loop control of vacations in queueing systems. The controller has to take actions without state information. We first consider the case of a single queue, in which the question is when should vacations be taken so as to minimize, in some general sense, workloads and waiting times. We then consider the case of several queues, in which service of one queue constitutes a vacation for others. This is the optimal polling problem. We solve both problems using new techniques from [2,4] based on multimodularity.

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. E. Altman, B. Gaujal and A. Hordijk, Multimodularity, convexity and optimization properties, INRIA Research Report No. 3181, http://www.inria.fr:80/RRRT/RR-3181.html (1997), to appear in Math. Oper. Res.

  2. E. Altman, B. Gaujal and A. Hordijk, Admission control in stochastic event graphs, INRIA Research Report No. 3179, http://www.inria.fr:80/RRRT/RR-3179.html (1997), to appear in J. of the ACM (2000).

  3. E. Altman, B. Gaujal and A. Hordijk, Balanced sequences and optimal routing, INRIA Research Report No. 3180, http://www.inria.fr:80/RRRT/RR-3180.html (1997), to appear in J. of the ACM (2000).

  4. E. Altman, B. Gaujal, A. Hordijk and G. Koole, Optimal admission, routing and service assignment control: The case of single buffer queues in: Proc. of the 37th IEEE Conf. on Decision and Control, Tampa, FL, USA, December 1998.

  5. E. Altman and A. Hordijk, Applications of Borovkov's renovation theory to non-stationary stochastic recursive sequences and their control, Adv. in Appl. Probab. 29 (1997) 388–413.

    Google Scholar 

  6. E. Altman, Z. Liu and R. Righter, Scheduling of an input-queued switch to achieve maximal throughput, Research Report 96-020, Leavey School of Business and Administration, Santa Clara, CA, USA, to appear in Probability in the Engineering and Informational Sciences (2000).

    Google Scholar 

  7. F. Baccelli and P. Brémaud, Elements of Queueing Theory (Springer, Berlin, 1994).

    Google Scholar 

  8. A.A. Borovkov, Asymptotic Methods in Queueing Theory (Wiley, New York, 1984) (translated from Russian).

    Google Scholar 

  9. A.A. Borovkov and S.G. Foss, Stochastically recursive sequences and their generalizations, Siberian Adv. Math. 2(1) (1992) 16–81.

    Google Scholar 

  10. B. Hajek, Extremal splitting of point processes, Math. Oper. Res. 10 (1985) 543–556.

    Google Scholar 

  11. A. Hordijk and A. Loeve, Optimal noncyclic server allocation in a polling model, in: Proc. of the 36th IEEE Conf. on Decision and Control, San Diego, CA, December 1997.

  12. R. Loynes, The stability of a queue with non-independent inter-arrival and service times, Proc. Cambridge Phil. Soc. 58(3) (1962) 497–520.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Altman, E., Gaujal, B. & Hordijk, A. Optimal Open-Loop Control of Vacations, Polling and Service Assignment. Queueing Systems 36, 303–325 (2000). https://doi.org/10.1023/A:1011085302786

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011085302786

Navigation