Skip to main content

Priority Management in a Semi-Markov Queuing Model

  • Conference paper
  • First Online:
Analytical and Computational Methods in Probability Theory (ACMPT 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10684))

Abstract

We study a single-channel queuing system with an arbitrary distribution of the duration of service requirements, on the input of which there are n Poisson processes. The requirements of the various processes come in different queues. The task is to determine the rule for selecting service requirements and to determine the optimal strategy for establishing dynamic priorities. We consider a case \(n=2\).

To this end, a controlled semi-Markov process is defined, on the trajectories of which a functional is constructed that determines the quality of management and takes into account the number of lost requirements, the number of serviced requirements, the time of the requirement stay in the system, and so on. An algorithm for determining the optimal strategy is formulated.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Kashtanov, V.A., Zaytseva, O.B.: Operations Research: Textbook, 256 p. INFRA-M, Moscow (2016)

    Google Scholar 

  2. Barzilovich, E.Yu., Belyaev, Yu.K., Kashtanov, V.A., et al.: Questions of a Mathematical Reliability Theory, 376 p. Radio i svaz’, Moscow (1983)

    Google Scholar 

  3. Mine, H., Osaki, S.: Markovian Decision Processes. Nauka, Moscow (1977)

    MATH  Google Scholar 

  4. Kondrashova, E.V.: Optimizing income function in controlled Markov queueing model. Upravlenie Bol’simi Sistemami 36, 93–105 (2011)

    Google Scholar 

  5. Kashtanov, V.A., Kondrashova, E.V.: Optimization of the CBSMAP-queueing model. In: Lecture Notes in Engineering and Computer Science, pp. 69–73. NL International Association of Engineers (2013)

    Google Scholar 

  6. Kondrashova, E.V., Kashtanov, V.A.: Research of optimum strategy for semi-Markov queueing models at control of CBSMAP-flow. Algorithmization. In: Dimov, I., Faragó, I., Vulkov, L. (eds.) NAA 2016. LNCS, vol. 10187, pp. 439–447. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57099-0_49

    Chapter  Google Scholar 

  7. Kashtanov, V.A., Medvedev, A.: Reliability Theory of the Composite Systems (Theory and Practice). Fizmatlit, Moscow (2010)

    Google Scholar 

  8. Ivchenko, G.I., Kashtanov, V.A., Kovalenko, I.N.: Theory of a Queuing. LIBROCOM, Moscow (2012)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zaytseva, O.B., Kondrashova, E.V. (2017). Priority Management in a Semi-Markov Queuing Model. In: Rykov, V., Singpurwalla, N., Zubkov, A. (eds) Analytical and Computational Methods in Probability Theory. ACMPT 2017. Lecture Notes in Computer Science(), vol 10684. Springer, Cham. https://doi.org/10.1007/978-3-319-71504-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71504-9_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71503-2

  • Online ISBN: 978-3-319-71504-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics