IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v2y2000i2d10.1023_a1010046006253.html
   My bibliography  Save this article

Optimal Operating Policy for an M/G/1 Exhaustive Server-Vacation Model

Author

Listed:
  • R. E. Lillo

    (Universidad Carlos III de Madrid)

Abstract

We consider an M/G/1 queueing system controlled by an exhaustive server–vacation policy, i.e, the server is turned off whenever the system becomes empty and it is turned on after a random time with at least a customer present in the system. In this paper, it is proved that there exists an exhaustive optimal policy which is of the form X + a(T - X)+, where, starting with the server off, X represents the time for the first arrival and T and a are non-negative real numbers. Using a classical average cost structure, the optimization problem is treated under the asymptotic average criterion. A structured definition of exhaustive policy is also derived.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:metcap:v:2:y:2000:i:2:d:10.1023_a:1010046006253
    DOI: 10.1023/A:1010046006253
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1010046006253
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1010046006253?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. Colin E. Bell, 1973. "Optimal Operation of an M / G /1 Priority Queue with Removable Server," Operations Research, INFORMS, vol. 21(6), pages 1281-1290, December.
    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. Colin E. Bell, 1975. "Technical Note—Turning Off a Server with Customers Present: Is This Any Way to Run an M / M / c Queue with Removable Servers?," Operations Research, INFORMS, vol. 23(3), pages 571-574, June.
    5. 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.
    6. Colin E. Bell, 1980. "Optimal Operation of an M / M /2 Queue with Removable Servers," Operations Research, INFORMS, vol. 28(5), pages 1189-1204, October.
    7. Thomas B. Crabill & Donald Gross & Michael J. Magazine, 1977. "A Classified Bibliography of Research on Optimal Design and Control of Queues," Operations Research, INFORMS, vol. 25(2), pages 219-232, April.
    8. Wayne Winston, 1978. "Technical Note—Optimality of Monotonic Policies for Multiple-Server Exponential Queuing Systems with State-Dependent Arrival Rates," Operations Research, INFORMS, vol. 26(6), pages 1089-1094, December.
    9. Teghem, J., 1986. "Control of the service process in a queueing system," European Journal of Operational Research, Elsevier, vol. 23(2), pages 141-158, February.
    10. Daniel P. Heyman, 1968. "Optimal Operating Policies for M / G /1 Queuing Systems," Operations Research, INFORMS, vol. 16(2), pages 362-382, April.
    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. 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.
    2. Zhang, Zhe G. & Tian, Naishuo, 2004. "An analysis of queueing systems with multi-task servers," European Journal of Operational Research, Elsevier, vol. 156(2), pages 375-389, July.
    3. Boronico, Jess S. & Siegel, Philip H., 1998. "Capacity planning for toll roadways incorporating consumer wait time costs," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(4), pages 297-310, May.
    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. 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.
    6. 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.
    7. R.E. Lillo, 2001. "Optimal control of an M/G/1 queue with impatient priority customers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(3), pages 201-209, April.
    8. 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.
    9. 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.
    10. Zhe George Zhang, 2009. "Performance Analysis of a Queue with Congestion-Based Staffing Policy," Management Science, INFORMS, vol. 55(2), pages 240-251, February.
    11. J. R. Artalejo & A. Economou, 2005. "Markovian Controllable Queueing Systems with Hysteretic Policies: Busy Period and Waiting Time Analysis," Methodology and Computing in Applied Probability, Springer, vol. 7(3), pages 353-378, September.
    12. 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.
    13. Tian, Naishuo & Zhang, Zhe George, 2006. "A two threshold vacation policy in multiserver queueing systems," European Journal of Operational Research, Elsevier, vol. 168(1), pages 153-163, January.
    14. 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.
    15. 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.
    16. Jae‐Dong Son & Yaghoub Khojasteh Ghamari, 2008. "Optimal admission and pricing control problems in service industries with multiple servers and sideline profit," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 24(4), pages 325-342, July.
    17. 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.
    18. Offer Kella, 1989. "The threshold policy in the M/G/1 queue with server vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(1), pages 111-123, February.
    19. Erim Kardeş & Fernando Ordóñez & Randolph W. Hall, 2011. "Discounted Robust Stochastic Games and an Application to Queueing Control," Operations Research, INFORMS, vol. 59(2), pages 365-382, April.
    20. 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.

    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:metcap:v:2:y:2000:i:2:d:10.1023_a:1010046006253. 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.