Skip to main content
SpringerLink
Log in

On Global Near Optimality of Special Periodic Protocols for Fluid Polling Systems with Setups

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

We consider a generic deterministic time-invariant fluid model of a polling system, where several buffers (queues) of infinite sizes receive constant rate inflows of jobs from outside the system and share a common source of service (a finite capacity server). The server can serve at most one buffer at a time and has to switch among buffers from time to time; any switch consumes a nonzero switch-over period. With respect to the long-run maximal scaled work in progress (wip) performance metric, near optimality of periodic scheduling and service protocols is established: The optimum can be furnished by such a protocol up to as small error as desired. To prove this, a special class of protocols is introduced, which prescribe to serve any buffer at the maximal rate until its size reduces to a pre-specified percent of its size at the beginning of the visit. It is also shown that the exhaustive policy is optimal for any buffer whose service at the maximal rate implies reduction in the scaled wip.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. When modeling a manufacturing process, with inflows to the queues being interpreted as flows of demands, this means that our study is confined to make-to-order strategies.

  2. If p is supplied with an index, the same index is attached to all components of p.

References

  1. Kleinrock, L.: Queueing Systems, vol. 2. Wiley, New York (1976)

    MATH  Google Scholar 

  2. Levy, H., Sidi, M.: Polling systems: applications, modeling, and optimization. IEEE Trans. Commun. 38(10), 1750–1760 (1990)

    Article  Google Scholar 

  3. Takagi, H.: Bibliography on polling models. Technical report, Institute of Socio-Economic Planning, University of Tsukuba, Tsukuba-shi, Japan (2001). http://www.sk.tsukuba.ac.jp/takagi/polling.html

  4. Vishnevskii, V., Semenova, O.: Mathematical methods to study the polling systems. Autom. Remote Control 67(2), 173–220 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  5. Blondel, V., Tsitsiklis, J.: A survey of computational complexity results in systems and control. Automatica 36, 1249–1274 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  6. Maimon, O., Khmelnitsky, E., Kogan, K.: Optimal Flow Control in Manufacturing Systems: Production Planning and Scheduling (Applied Optimization). Kluwer, Dordrecht (2010)

    MATH  Google Scholar 

  7. Duenyas, I., Oyen, M.V.: Heuristic scheduling of parallel heterogeneous queues with setups. Manag. Sci. 42, 814–829 (1996)

    Article  MATH  Google Scholar 

  8. Dempster, M., Lenstra, J., Kan, A.R.: Deterministic and stochastic scheduling. In: NATO Advanced Study Institute Series; C: Mathematical and Physical Science. D. Reidel, Dordrecht (1982)

  9. Baras, J., Ma, D., Makowski, A.: \(K\) competing queues with geometric service requirements and linear costs: the \(c\mu \) rule is always optimal. Syst. Control Lett. 6, 173–180 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  10. Perkins, J., Srikant, R.: Scheduling multiple part-types in an unreliable single-machine manufacturing system. IEEE Trans. Autom. Control 43(3), 364–377 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  11. Martinelli, F., Valigi, P.: The impact of finite buffers on the optimal scheduling of a single-machine two-part-type manufacturing system. IEEE Trans. Autom. Control 47, 1705–1710 (2002)

    Article  MathSciNet  Google Scholar 

  12. Gaujal, B., Hordijk, A., van der Laan, D.: On the optimal open-loop control policy for deterministic and exponential polling systems. Probab. Eng. Inf. Sci. 21(2), 151–176 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hofri, M., Ross, K.: On the optimal control of two queues with server setup times and its analysis. SIAM J. Comput. 16(2), 399–420 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  14. Reiman, M., Wein, L.M.: Dynamic scheduling of a two-class queue with setups. Oper. Res. 46(4), 532–547 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  15. Nobel, R., Tijms, H.C.: Optimal control for an m-x/g/1 queue with two service modes. Eur. J. Oper. Res. 103(3), 610–619 (1999)

    Article  MATH  Google Scholar 

  16. Gaudio, M.D., Martinelli, E., Valigi, P.: A scheduling problem for two competing queues with finite capacity and non negligible setup times. In: Proceedings of the 40th IEEE Conference on Decision and Control, pp. 2355–2360. Orlando, FL (2001)

  17. Nobel, R., Bekker, R.: Optimal control for two finite-buffer queues with batch arrivals and one switching server. In: Artalejo, J., Krishnamoorthy, A. (eds.) Advances in Stochastic Modelling, pp. 345–365. Notable Publications Inc., Rochester, NJ (2002)

    Google Scholar 

  18. Boccadoro, M., Valigi, P.: Optimal control of two symmetric competing queues with finite capacity and non negligible setup times. In: Proceedings of the IEEE Conference on Emerging Technologies and Factory Automation, pp. 260–266. Lisbon, Portugal (2003)

  19. van Eekelen, J., Lefeber, E., Rooda, J.: Feedback control of 2-product server with setups and bounded buffers. In: Proceedings of the 2006 American Control Conference, pp. 544–549. Minneapolis, MN (2006)

  20. Liu, Z., Nain, P., Towsley, D.: On optimal polling policies. Queueing Syst. 11, 59–83 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  21. van der Mei, R., Levy, H.: Polling systems in heavy traffic: exhaustiveness of service policies. Queueing Syst. Theory Appl. 27, 227–250 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  22. Browne, S., Yechiali, U.: Dynamic priority rules for cyclic type queues. Adv. Appl. Probab. 21, 432–450 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  23. Markowitz, D., Reiman, M., Wein, L.: The stochastic economic lot scheduling problem: heavy traffic analysis of dynamic cyclic policies. Oper. Res. 48(1), 136–154 (2000)

    Article  Google Scholar 

  24. Aytug, H., Lawley, M., McKay, K., Mohan, S.: Executing production schedules in the face of uncertainties: a review and some future directions. Eur. J. Oper. Res. 161(1), 86–110 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  25. Ouelhadj, D., Petrovic, S.: A survey of dynamic scheduling in manufacturing systems. J. Sched. 161, 1099–1125 (2008)

    MathSciNet  MATH  Google Scholar 

  26. Terekhov, D., Down, D., Beck, J.: Queueing-theoretic approaches for dynamic scheduling: a survey. Surv. Oper. Res. Manag. Sci. 19(2), 105–129 (2014)

    MathSciNet  Google Scholar 

  27. Matveev, A.S., Savkin, A.V.: Qualitative Theory of Hybrid Dynamical Systems. Birkhäuser, Boston (2000)

    Book  MATH  Google Scholar 

  28. Feoktistova, V., Matveev, A., Lefeber, E., Rooda, J.: Designs of optimal switching feedback decentralized control policies for fluid queueing networks. Math. Control Signals Syst. 24(4), 477–503 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  29. Hopp, W.J., Spearman, M.L.: Factory Physics. McGraw-Hill, New York (2000)

    Google Scholar 

  30. Lan, W.M., Olsen, T.: Multiproduct systems with both setup times and costs: fluid bounds and schedules. Oper. Res. 54(3), 505–525 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  31. Horn, R., Johnson, C.: Matrix Analysis. Cambridge University Press, Cambridge (1990)

    MATH  Google Scholar 

Download references

Acknowledgments

This work was supported by the Russian Science Foundation, Project No. 14-21-00041 (Sects. 3–5), and SPbSU, Grant 6.38.230.2015 (Sects. 1, 2, 6).

Author information

Authors and Affiliations

  1. Saint Petersburg State University, Saint Petersburg, Russia

    Alexey Matveev, Varvara Feoktistova & Ksenia Bolshakova

Authors
  1. Alexey Matveev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Varvara Feoktistova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ksenia Bolshakova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexey Matveev.

Additional information

Communicated by Kyriakos G. Vamvoudakis.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Matveev, A., Feoktistova, V. & Bolshakova, K. On Global Near Optimality of Special Periodic Protocols for Fluid Polling Systems with Setups. J Optim Theory Appl 171, 1055–1070 (2016). https://doi.org/10.1007/s10957-016-0923-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-016-0923-0

Keywords

Mathematics Subject Classification

Search

Navigation