IDEAS home Printed from https://ideas.repec.org/a/spr/cejnor/v17y2009i4p425-431.html
   My bibliography  Save this article

Notes of M/G/1 system under the $${\langle p, T \rangle}$$ policy with second optional service

Author

Listed:
  • Jau-Chuan Ke
  • Yunn-Kuang Chu

Abstract

We optimize the operating cost of the $${\langle p, T \rangle}$$ policy for an M/G/1 queueing system with second optional service, where the customer may depart from the system either after the first essential service with probability 1 − r or at the end of the first service may immediately go for a second service with probability r. Moreover, the server takes a vacation of fixed length T if the system becomes empty. If customers are found in the queue after T time units have elapsed since the end of the busy period, the server reactivates with probability p or leaves for a vacation of the same length T with probability 1 − p. Alternatively, if no customers present in the queue upon returning from the vacation, the server leaves for another a vacation of the same length. We call this $${\langle p, T \rangle}$$ policy. The total expected cost function per unit time is developed to determine the optimal thresholds of p and T at a minimum cost. Based on the optimal cost the explicit form for joint optimum values of p and T are obtained. Copyright Springer-Verlag 2009

Suggested Citation

  • Jau-Chuan Ke & Yunn-Kuang Chu, 2009. "Notes of M/G/1 system under the $${\langle p, T \rangle}$$ policy with second optional service," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 17(4), pages 425-431, December.
  • Handle: RePEc:spr:cejnor:v:17:y:2009:i:4:p:425-431
    DOI: 10.1007/s10100-009-0101-7
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10100-009-0101-7
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10100-009-0101-7?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. Yonatan Levy & Uri Yechiali, 1975. "Utilization of Idle Time in an M/G/1 Queueing System," Management Science, INFORMS, vol. 22(2), pages 202-211, October.
    2. 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.
    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. Jennifer Sommer & Joost Berkhout & Hans Daduna & Bernd Heidergott, 2017. "Analysis of Jackson networks with infinite supply and unreliable nodes," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 181-207, October.
    2. B. Krishna Kumar & S. Pavai Madheswari & S. Anantha Lakshmi, 2011. "Queuing system with state-dependent controlled batch arrivals and server under maintenance," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(2), pages 351-379, December.
    3. Delasay, Mohammad & Ingolfsson, Armann & Kolfal, Bora & Schultz, Kenneth, 2019. "Load effect on service times," European Journal of Operational Research, Elsevier, vol. 279(3), pages 673-686.
    4. Madhu Jain & Sandeep Kaur & Parminder Singh, 2021. "Supplementary variable technique (SVT) for non-Markovian single server queue with service interruption (QSI)," Operational Research, Springer, vol. 21(4), pages 2203-2246, December.
    5. 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.
    6. Achyutha Krishnamoorthy & Anu Nuthan Joshua & Dmitry Kozyrev, 2021. "Analysis of a Batch Arrival, Batch Service Queuing-Inventory System with Processing of Inventory While on Vacation," Mathematics, MDPI, vol. 9(4), pages 1-29, February.
    7. Jau-Chuan Ke, 2006. "An M/G/1 queue under hysteretic vacation policy with an early startup and un-reliable server," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(2), pages 357-369, May.
    8. Garcia-Sanz, M.D. & Fernandez, F.R. & Fiestras-Janeiro, M.G. & Garcia-Jurado, I. & Puerto, J., 2008. "Cooperation in Markovian queueing models," European Journal of Operational Research, Elsevier, vol. 188(2), pages 485-495, July.
    9. Terekhov, Daria & Christopher Beck, J., 2009. "An extended queueing control model for facilities with front room and back room operations and mixed-skilled workers," European Journal of Operational Research, Elsevier, vol. 198(1), pages 223-231, October.
    10. Shweta Upadhyaya, 2020. "Investigating a general service retrial queue with damaging and licensed units: an application in local area networks," OPSEARCH, Springer;Operational Research Society of India, vol. 57(3), pages 716-745, September.
    11. 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.
    12. Bu, Qihui & Sun, Yun & Chai, Xudong & Liu, Liwei, 2020. "Strategic behavior and social optimization in a clearing queueing system with N-policy and stochastic restarting scheme," Applied Mathematics and Computation, Elsevier, vol. 381(C).
    13. M. I. G. Suranga Sampath & K. Kalidass & Jicheng Liu, 2020. "Transient Analysis of an M/M/1 Queueing System Subjected to Multiple Differentiated Vacations, Impatient Customers and a Waiting Server with Application to IEEE 802.16E Power Saving Mechanism," Indian Journal of Pure and Applied Mathematics, Springer, vol. 51(1), pages 297-320, March.
    14. Daria Terekhov & J. Christopher Beck & Kenneth N. Brown, 2009. "A Constraint Programming Approach for Solving a Queueing Design and Control Problem," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 549-561, November.
    15. 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.
    16. 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.
    17. Willmot, Gordon E. & Lin, Xiaodong, 1996. "Bounds on the tails of convolutions of compound distributions," Insurance: Mathematics and Economics, Elsevier, vol. 18(1), pages 29-33, May.
    18. Janani, B., 2022. "Transient Analysis of Differentiated Breakdown Model," Applied Mathematics and Computation, Elsevier, vol. 417(C).
    19. Mouloud Cherfaoui & Aicha Bareche, 2020. "An optimal approximation of the characteristics of the GI/M/1 queue with two-stage service policy," Operational Research, Springer, vol. 20(2), pages 959-983, June.
    20. 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.

    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:cejnor:v:17:y:2009:i:4:p:425-431. 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.