IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v63y2006i2p357-369.html
   My bibliography  Save this article

An M/G/1 queue under hysteretic vacation policy with an early startup and un-reliable server

Author

Listed:
  • Jau-Chuan Ke

Abstract

This paper considers the bi-level control of an M/G/1 queueing system, in which an un-reliable server operates N policy with a single vacation and an early startup. The server takes a vacation of random length when he finishes serving all customers in the system (i.e., the system is empty). Upon completion of the vacation, the server inspects the number of customers waiting in the queue. If the number of customers is greater than or equal to a predetermined threshold m, the server immediately performs a startup time; otherwise, he remains dormant in the system and waits until m or more customers accumulate in the queue. After the startup, if there are N or more customers waiting for service, the server immediately begins serving the waiting customers. Otherwise the server is stand-by in the system and waits until the accumulated number of customers reaches or exceeds N. Further, it is assumed that the server breaks down according to a Poisson process and his repair time has a general distribution. We obtain the probability generating function in the system through the decomposition property and then derive the system characteristics Copyright Springer-Verlag 2006

Suggested Citation

  • 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.
    • Handle: RePEc:spr:mathme:v:63:y:2006:i:2:p:357-369
    DOI: 10.1007/s00186-005-0046-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00186-005-0046-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00186-005-0046-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. Kimura, Toshikazu, 1981. "Optimal control of an M/G/1 queuing system with removable server via diffusion approximation," European Journal of Operational Research, Elsevier, vol. 8(4), pages 390-398, December.
    2. Matthew J. Sobel, 1969. "Optimal Average-Cost Policy for a Queue with Start-Up and Shut-Down Costs," Operations Research, INFORMS, vol. 17(1), pages 145-162, February.
    3. S. W. Fuhrmann & Robert B. Cooper, 1985. "Stochastic Decompositions in the M / G /1 Queue with Generalized Vacations," Operations Research, INFORMS, vol. 33(5), pages 1117-1129, October.
    4. 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.
    5. Hersh, Marvin & Brosh, Israel, 1980. "The optimal strategy structure of an intermittently operated service channel," European Journal of Operational Research, Elsevier, vol. 5(2), pages 133-141, August.
    6. Minh, Do Le, 1988. "Transient solutions for some exhaustive M/G/1 queues with generalized independent vacations," European Journal of Operational Research, Elsevier, vol. 36(2), pages 197-201, August.
    7. Teghem, J., 1987. "Optimal control of a removable server in an M/G/1 queue with finite capacity," European Journal of Operational Research, Elsevier, vol. 31(3), pages 358-367, September.
    8. Jau-Chuan Ke, 2001. "The control policy of an M[x]/G/1 queueing system with server startup and two vacation types," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 54(3), pages 471-490, December.
    9. Colin E. Bell, 1971. "Characterization and Computation of Optimal Policies for Operating an M / G /1 Queuing System with Removable Server," Operations Research, INFORMS, vol. 19(1), pages 208-218, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jewgeni H. Dshalalow & Ahmed Merie & Ryan T. White, 2020. "Fluctuation Analysis in Parallel Queues with Hysteretic Control," Methodology and Computing in Applied Probability, Springer, vol. 22(1), pages 295-327, March.
    2. Miaomiao Yu & Yinghui Tang, 2022. "Analysis of a renewal batch arrival queue with a fault-tolerant server using shift operator method," Operational Research, Springer, vol. 22(3), pages 2831-2858, July.

    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. Ke, Jau-Chuan & Wang, Kuo-Hsiung, 2002. "A recursive method for the N policy G/M/1 queueing system with finite capacity," European Journal of Operational Research, Elsevier, vol. 142(3), pages 577-594, November.
    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. K.-H. Wang & C.-C. Kuo & W. L. Pearn, 2007. "Optimal Control of an M/G/1/K Queueing System with Combined F Policy and Startup Time," Journal of Optimization Theory and Applications, Springer, vol. 135(2), pages 285-299, November.
    4. 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.
    5. Priyanka Kalita & Gautam Choudhury & Dharmaraja Selvamuthu, 2020. "Analysis of Single Server Queue with Modified Vacation Policy," Methodology and Computing in Applied Probability, Springer, vol. 22(2), pages 511-553, June.
    6. Tayfur Altiok & Goang An Shiue, 1995. "Single‐stage, multi‐product production/inventory systems with lost sales," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 889-913, September.
    7. 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.
    8. Cigdem Gurgur, 2013. "Optimal configuration of a decentralized, market-driven production/inventory system," Annals of Operations Research, Springer, vol. 209(1), pages 139-157, October.
    9. Wei Li & Attahiru Sule Alfa, 2000. "Optimal policies for M/M/m queue with two different kinds of (N, T)‐policies," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(3), pages 240-258, April.
    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. Jim (Junmin) Shi & Michael N. Katehakis & Benjamin Melamed & Yusen Xia, 2014. "Production-Inventory Systems with Lost Sales and Compound Poisson Demands," Operations Research, INFORMS, vol. 62(5), pages 1048-1063, October.
    13. 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.
    14. B. Kumar & D. Arivudainambi & A. Krishnamoorthy, 2006. "Some results on a generalized M/G/1 feedback queue with negative customers," Annals of Operations Research, Springer, vol. 143(1), pages 277-296, March.
    15. 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.
    16. Dimitris Bertsimas & José Niño-Mora, 1996. "Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case," Economics Working Papers 314, Department of Economics and Business, Universitat Pompeu Fabra, revised Aug 1998.
    17. Izak Duenyas & Diwakar Gupta & Tava Lennon Olsen, 1998. "Control of a Single-Server Tandem Queueing System with Setups," Operations Research, INFORMS, vol. 46(2), pages 218-230, April.
    18. Sem Borst & Onno Boxma, 2018. "Polling: past, present, and perspective," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 335-369, October.
    19. Dimitris Bertsimas & José Niño-Mora, 1999. "Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part I, The Single-Station Case," Mathematics of Operations Research, INFORMS, vol. 24(2), pages 306-330, May.
    20. George C. Mytalas & Michael A. Zazanis, 2022. "Service with a queue and a random capacity cart: random processing batches and E-limited policies," Annals of Operations Research, Springer, vol. 317(1), pages 147-178, October.

    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:mathme:v:63:y:2006:i:2:p:357-369. 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.