IDEAS home Printed from https://ideas.repec.org/a/spr/operea/v16y2016i2d10.1007_s12351-015-0190-0.html
   My bibliography  Save this article

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

Author

Listed:
  • Miaomiao Yu

    (Sichuan University of Science and Engineering
    University of Manitoba)

  • Attahiru Sule Alfa

    (University of Manitoba
    University of Pretoria)

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.

Suggested Citation

  • Miaomiao Yu & Attahiru Sule Alfa, 2016. "Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue," Operational Research, Springer, vol. 16(2), pages 161-179, July.
    • Handle: RePEc:spr:operea:v:16:y:2016:i:2:d:10.1007_s12351-015-0190-0
    DOI: 10.1007/s12351-015-0190-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12351-015-0190-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12351-015-0190-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Alfa, Attahiru Sule & Frigui, Imed, 1996. "Discrete NT-policy single server queue with Markovian arrival process and phase type service," European Journal of Operational Research, Elsevier, vol. 88(3), pages 599-613, February.
    2. K. R. Balachandran, 1973. "Control Policies for a Single Server System," Management Science, INFORMS, vol. 19(9), pages 1013-1018, May.
    3. Daniel P. Heyman, 1977. "The T-Policy for the M/G/1 Queue," Management Science, INFORMS, vol. 23(7), pages 775-778, March.
    4. L Tadj, 2003. "On an M/G/1 quorum queueing system under T-policy," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 466-471, May.
    5. Zhang, Zhe George & Tadj, Lotfi & Bounkhel, Messaoud, 2011. "Cost evaluation in M/G/1 queue with T-policy revisited, technical note," European Journal of Operational Research, Elsevier, vol. 214(3), pages 814-817, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Xuelu & Wang, Jinting & Do, Tien Van, 2015. "Threshold properties of the M/M/1 queue under T-policy with applications," Applied Mathematics and Computation, Elsevier, vol. 261(C), pages 284-301.
    2. uit het Broek, Michiel A.J. & Van der Heide, Gerlach & Van Foreest, Nicky D., 2020. "Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs," European Journal of Operational Research, Elsevier, vol. 287(3), pages 916-928.
    3. Zhang, Zhe George & Tadj, Lotfi & Bounkhel, Messaoud, 2011. "Cost evaluation in M/G/1 queue with T-policy revisited, technical note," European Journal of Operational Research, Elsevier, vol. 214(3), pages 814-817, November.
    4. P. Vijaya Laxmi & E. Girija Bhavani & K. Jyothsna, 2023. "Analysis of Markovian queueing system with second optional service operating under the triadic policy," OPSEARCH, Springer;Operational Research Society of India, vol. 60(1), pages 256-275, March.
    5. Hanukov, Gabi, 2022. "Improving efficiency of service systems by performing a part of the service without the customer's presence," European Journal of Operational Research, Elsevier, vol. 302(2), pages 606-620.
    6. Dong-Yuh Yang & Po-Kai Chang, 2015. "A parametric programming solution to the -policy queue with fuzzy parameters," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(4), pages 590-598, March.
    7. Eugene Feinberg, 2005. "On essential information in sequential decision processes," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 62(3), pages 399-410, December.
    8. Renbin Liu & Attahiru Sule Alfa & Miaomiao Yu, 2019. "Analysis of an ND-policy Geo/G/1 queue and its application to wireless sensor networks," Operational Research, Springer, vol. 19(2), pages 449-477, June.
    9. Imed Frigui & Attahiru Sule Alfa & Xiaoyi Xu, 1997. "Algorithms for computing waiting time distributions under different queue disciplines for the D‐BMAP/PH/1," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(6), pages 559-576, September.
    10. Tirdad, Ali & Grassmann, Winfried K. & Tavakoli, Javad, 2016. "Optimal policies of M(t)/M/c/c queues with two different levels of servers," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1124-1130.
    11. Lotfi Tadj & Gautam Choudhury, 2005. "Optimal design and control of queues," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(2), pages 359-412, December.
    12. Baek, Jung Woo & Bae, Yun Han, 2022. "A queuing-inventory model for manufacturing systems with fluid-type inventory," Omega, Elsevier, vol. 111(C).
    13. Samanta, S.K. & Gupta, U.C. & Sharma, R.K., 2007. "Analyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations," European Journal of Operational Research, Elsevier, vol. 182(1), pages 321-339, October.
    14. R. E. Lillo, 2000. "Optimal Operating Policy for an M/G/1 Exhaustive Server-Vacation Model," Methodology and Computing in Applied Probability, Springer, vol. 2(2), pages 153-167, August.
    15. Zhen Wang & Liwei Liu & Yiqiang Q. Zhao, 2022. "Equilibrium customer and socially optimal balking strategies in a constant retrial queue with multiple vacations and N-policy," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 870-908, May.
    16. Jung Baek & Ho Lee & Se Lee & Soohan Ahn, 2013. "A MAP-modulated fluid flow model with multiple vacations," Annals of Operations Research, Springer, vol. 202(1), pages 19-34, January.
    17. Wang, Jinting & Zhang, Xuelu & Huang, Ping, 2017. "Strategic behavior and social optimization in a constant retrial queue with the N-policy," European Journal of Operational Research, Elsevier, vol. 256(3), pages 841-849.
    18. Ying Xu & Alan Scheller-Wolf & Katia Sycara, 2015. "The Benefit of Introducing Variability in Single-Server Queues with Application to Quality-Based Service Domains," Operations Research, INFORMS, vol. 63(1), pages 233-246, February.
    19. Wei Yingyuan & Tang Yinghui & Yu Miaomiao, 2020. "Recursive Solution of Queue Length Distribution for Geo/G/1 Queue with Delayed Min(N, D)-Policy," Journal of Systems Science and Information, De Gruyter, vol. 8(4), pages 367-386, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:operea:v:16:y:2016:i:2:d:10.1007_s12351-015-0190-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.