Skip to main content

Optimization of the Modified T Vacation Policy for a Discrete-Time \(\mathrm {Geom}^{[X]}/\mathrm {G}/1\) Queueing System with Startup

  • Conference paper
  • First Online:
Fuzzy Information and Engineering and Decision (IWDS 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 646))

Included in the following conference series:

  • 870 Accesses

Abstract

In this paper, we discuss a discrete-time Geom\({^{[X]}}\)/G/1 queueing system with modified T vacation policy and startup time. We derive the generating functions and the mean values for the steady state system size and the waiting time, and also get those of the busy period, the vacation period and the vacation cycle by using embedded Markov chain. Finally, we determine the optimal \({(T^*,J^*)}\) to minimize the cost function with fixed cost elements by constructing a cost function.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Levy, Y., Yechiali, U.: Utilization of idle time in an M/G/1 queue. Manage. Sci. 22, 202–211 (1975)

    Article  MATH  Google Scholar 

  2. Heyman, D.P.: The \(T\) policy for the M/G/1 queue. Manage. Sci. 23, 775–778 (1977)

    Article  MATH  Google Scholar 

  3. Sen, K., Gupta, R.: Time dependent analysis of \(T\)-policy M/M/1 queues-A new approach. Studia Scientiarum Mathematicarum Hungarica 34(4), 453–473 (1998)

    MathSciNet  MATH  Google Scholar 

  4. Ke, J.C.: Modified \(T\) vacation policy for an M/G/1 queueing system with an unriliable server and startup. Mathe. Comput. Model. 41, 1267–1277 (2005)

    Article  MATH  Google Scholar 

  5. Ke, J.C.: Two thresholds of a batch arrival queueing system under modified \(T\) vacation policy with startup and closedown. Mathe. Methods Appl. Sci. 31(2), 229–247 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Tadj, L.: On an M/G/1 quorum queueing system under \(T\) policy. J. Oper. Res. Soc. 54, 446–471 (2003)

    Article  MATH  Google Scholar 

  7. Kim, D.J., Moon, S.A.: Randomized control of \(T\) policy for an M/G/1 system. Comput. Ind. Eng. 51(4), 684–692 (2006)

    Article  Google Scholar 

  8. Wang, K.H., Pearn, W.L.: Maximum entropy analysis to the \(T\) policy M/G/1 queue with server breakdowns and startup times. Int. J. Inf. Manage. Sci. 20(3), 395–414 (2009)

    MathSciNet  MATH  Google Scholar 

  9. Wang, T.Y., Wang, K.H., Pearn, W.L.: Optimization of the \(T\) policy M/G/1 queue with server breakdowns and general startup times. J. Comput. Appl. Math. 228, 270–278 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Luo, C.Y., Tang, Y.H., Chao, B.S., Xiang, K.L.: Performance analysis of a discrete-time Geo/G/1 queue with randomized vacations and at most J vacations. Appl. Math. Model. 37(9), 6489–6504 (2013)

    Article  MathSciNet  Google Scholar 

  11. Wu, C.H., Lee, W.C., Ke, J.C., Liu, T.H.: Optimization analysis of an unreliable multi-server queue with a controllable repair policy. Comput. Oper. Res. 49, 83–96 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  12. Wei, C.M., Cai, L., Wang, J.J.: A discrete-time Geom/G/1 retrial queue with balking customers and second optional service. OPSEARCH 53, 344–357 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  13. Zhang, X.L., Wang, J.T., Do, T.V.: Threshold properties of the M/M/1 queue under T-policy with applications. Appl. Math. Comput. 261, 284–301 (2015)

    MathSciNet  Google Scholar 

  14. Lim, D.E., Lee, D.H., Yang, W.S., Chae, K.C.: Analysis of the GI/Geo/1 queue with N-policy. Appl. Math. Model. 37(7), 4643–4652 (2013). Original research article

    Article  MathSciNet  Google Scholar 

  15. Takagi, H.: Queueing analysis-a foundation of performance evaluation, Discrete time systems, vol. 3, North-holland, Amsterdam (1993)

    Google Scholar 

Download references

Acknowledgements

Thanks to the support by National Natural Science Foundation of China (No. 61175073).

Recommender: Professor Lv Shengli, School of Science, Yanshan University, Qinhuangdao 066004 P.R. China.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yan Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Lin, XW., Chen, Y., Wei, CM., Fan, Z. (2018). Optimization of the Modified T Vacation Policy for a Discrete-Time \(\mathrm {Geom}^{[X]}/\mathrm {G}/1\) Queueing System with Startup. In: Cao, BY. (eds) Fuzzy Information and Engineering and Decision. IWDS 2016. Advances in Intelligent Systems and Computing, vol 646. Springer, Cham. https://doi.org/10.1007/978-3-319-66514-6_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-66514-6_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-66513-9

  • Online ISBN: 978-3-319-66514-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics