Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue | Operational Research Skip to main content
Springer Nature Link
Log in

Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

The prime objective of this paper is to give some analysis results concerning the discrete-time finite-buffer NT-policy queue, which can be utilized to determine the optimal threshold values. By recording the waiting time of the leading customer in server’s vacation period, the model is successfully described as a vector-valued Markov chain. Meanwhile, depending on the special block structure of the one-step transition probability matrix, the equilibrium queue length distribution is calculated through a more effective UL-type RG-factorization. Due to the number of customers served in the busy period does not have the structure of a Galton-Watson branching process, analysis of the regeneration cycle is regarded as a difficult problem in establishing the cost structure of the queueing system. However, employing the concept of i-busy period and some difference equation solving skills, the explicit expression for the expected length of the regeneration cycle is easily derived, and the stochastic decomposition structure of the busy period is also demonstrated. Finally, numerical results are offered to illustrate how the direct search method can be implemented to obtain the optimal management policy.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Alfa AS, Frigui I (1996) Discrete NT-policy single server queue with Markovian arrival process and phase type service. Eur J Oper Res 88:599–613

    Article  Google Scholar 

  • Alfa AS, Li W (2000) Optimal (N, T)-policy for M/G/1 system with cost structures. Perform Eval 42:265–277

    Article  Google Scholar 

  • Balachandran KR (1973) Control policies for a single server system. Manag Sci 19:1013–1018

    Article  Google Scholar 

  • Doganata YN (1990) NT-vacation policy for M/G/1 queue with starter. In: Arikan E (ed) Communication, control, and signal processing. Elsevier Science Publishers, Amsterdam, pp 1663–1669

    Google Scholar 

  • Doshi BT (1986) Queueing systems with vacations-A survey. Queueing Syst 1:29–66

    Article  Google Scholar 

  • Feyaerts B, Vuyst SD, Wittevrongel S, Bruneel H (2010) Analysis of a discrete-time queueing system with an NT-policy. Lect Notes Comput 6148:29–43

    Article  Google Scholar 

  • Feyaerts B, Vuyst SD, Bruneel H, Wittevrongel S (2014) The impact of the NT-policy on the behaviour of a discrete-time queue with general service times. J Ind Manag Optim 10:131–149

    Google Scholar 

  • Feinberg EA, Kim DJ (1996) Bicriterion optimization of an M/G/1 queue with a removable server. Probab Eng Inf Sci 10:57–73

    Article  Google Scholar 

  • Gakis KG, Rhee HK, Sivazlian BD (1995) Distributions and first moments of the busy and idle periods in controllable M/G/1 queueing models with simple and dyadic policies. Stoch Anal Appl 13:47–81

    Article  Google Scholar 

  • Gupta SM (1995) Interrelationship between controlling arrival and service in queueing systems. Comput Oper Res 22:1005–1014

    Article  Google Scholar 

  • Heyman DP (1977) T-policy for the M/G/1 queue. Manag Sci 23:775–778

    Article  Google Scholar 

  • Hur S, Kim J, Kang C (2003) An analysis of the M/G/1 system with N and T policy. Appl Math Model 27:665–675

    Article  Google Scholar 

  • Jiang FC, Huang DC, Yang CT, Lin CH, Wang KH (2010) Design strategy for optimizing power consumption of sensor node with Min(N, T) policy M/G/1 queuing models. Int J Commun Syst 25:652–671

    Article  Google Scholar 

  • Ke JC (2005) Modified T vacation policy for an M/G/1 queueing system with an un-reliable server and startup. Math Comput Model 41:1267–1277

    Article  Google Scholar 

  • Ke JC (2006a) On M/G/1 system under NT policies with breakdowns, startup and closedown. Appl Math Model 30:49–66

    Article  Google Scholar 

  • Ke JC (2006b) Optimal NT policies for M/G/1 system with a startup and unreliable server. Comput Ind Eng 50:248–262

    Article  Google Scholar 

  • Li QL (2010) Constructive computation in stochastic models with applications: the RG-factorizations. Springer, New York

    Book  Google Scholar 

  • Li W, Alfa AS (2000) Optimal policies for M/M/m queue with two different kinds of (N, T)-policies. Naval Res Logist 47:240–258

    Article  Google Scholar 

  • Pacheco A, Ribeiro H (2008) Moments of the duration of busy periods of \(\text{ M }^X\)/G/1/n systems. Probab Eng Inf Sci 22:347–354

    Article  Google Scholar 

  • Ross SM (1996) Stochastic processes, 2nd edn. Wiley, New York

    Google Scholar 

  • Tadj L (2003) On an M/G/1 quorum queueing system under T-policy. J Oper Res Soc 54:466–471

    Article  Google Scholar 

  • Wu WQ, Tang YH, Yu MM (2014) Analysis of an M/G/1 queue with multiple vacations, N-policy, unreliable service station and repair facility failures. Int J Supply Oper Manag 1:1–19

    Google Scholar 

  • Yadin M, Naor P (1963) Queueing systems with a removable service station. Oper Res Q 14:393–405

    Article  Google Scholar 

  • Zhang ZG, Tadj L, Bounkhel M (2011) Cost evaluation in M/G/1 queue with T-policy revisited, technical note. Eur J Oper Res 214:814–817

    Article  Google Scholar 

Download references

Acknowledgments

The authors would like to thank the anonymous reviewers for their valuable comments and suggestions to improve the quality of this paper. This research was partially supported by grant from NSERC DAS programs, National Natural Science Foundation of China (Nos. 71301111, 71171138, 71402072) and the FSUSE (No.2012RC23).

Author information

Authors and Affiliations

  1. School of Science, Sichuan University of Science and Engineering, Zigong, 643000, Sichuan, China

    Miaomiao Yu

  2. Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB, R3T 5V6, Canada

    Miaomiao Yu & Attahiru Sule Alfa

  3. Department of Electrical, Electronic and Computer Engineering, University of Pretoria, Pretoria, 0002, South Africa

    Attahiru Sule Alfa

Authors
  1. Miaomiao Yu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Attahiru Sule Alfa
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Miaomiao Yu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yu, M., Alfa, A.S. Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue. Oper Res Int J 16, 161–179 (2016). https://doi.org/10.1007/s12351-015-0190-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-015-0190-0

Keywords

Mathematics Subject Classification