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.

    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. 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)

    More about this item

    Keywords

    Control; Cost; Optimization; Optional service;

    Statistics

    Access and download statistics

    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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.