IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v48y2001i3p201-209.html
   My bibliography  Save this article

Optimal control of an M/G/1 queue with impatient priority customers

Author

Listed:
  • R.E. Lillo

Abstract

An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:48:y:2001:i:3:p:201-209
    DOI: 10.1002/nav.2
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.2
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.2?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
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Raman K. Nurani & Sridhar Seshadri & J. George Shanthikumar, 1997. "Optimal Control of a Single Stage Production System Subject to Random Process Shifts," Operations Research, INFORMS, vol. 45(5), pages 713-724, October.
    3. Refael Hassin & Moshe Haviv, 1997. "Equilibrium Threshold Strategies: The Case of Queues with Priorities," Operations Research, INFORMS, vol. 45(6), pages 966-973, December.
    4. 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.
    5. Forsberg, Rolf, 1995. "Optimization of order-up-to-S policies for two-level inventory systems with compound Poisson demand," European Journal of Operational Research, Elsevier, vol. 81(1), pages 143-153, February.
    6. 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)

    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. 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.
    3. 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.
    4. 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.
    5. V. Radhamani & B. Sivakumar & G. Arivarignan, 2022. "A Comparative Study on Replenishment Policies for Perishable Inventory System with Service Facility and Multiple Server Vacation," OPSEARCH, Springer;Operational Research Society of India, vol. 59(1), pages 229-265, March.
    6. Armero, Carmen & Conesa, David, 2004. "Statistical performance of a multiclass bulk production queueing system," European Journal of Operational Research, Elsevier, vol. 158(3), pages 649-661, November.
    7. Dimitrakopoulos, Y. & Burnetas, A.N., 2016. "Customer equilibrium and optimal strategies in an M/M/1 queue with dynamic service control," European Journal of Operational Research, Elsevier, vol. 252(2), pages 477-486.
    8. Haque, Lani & Armstrong, Michael J., 2007. "A survey of the machine interference problem," European Journal of Operational Research, Elsevier, vol. 179(2), pages 469-482, June.
    9. 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.
    10. Luyi Yang & Laurens G. Debo & Varun Gupta, 2019. "Search Among Queues Under Quality Differentiation," Management Science, INFORMS, vol. 65(8), pages 3605-3623, August.
    11. Mark Fackrell & Peter Taylor & Jiesen Wang, 2021. "Strategic customer behavior in an M/M/1 feedback queue," Queueing Systems: Theory and Applications, Springer, vol. 97(3), pages 223-259, April.
    12. Prak, Derk & Teunter, Rudolf & Babai, M. Z. & Syntetos, A. A. & Boylan, D, 2018. "Forecasting and Inventory Control with Compound Poisson Demand Using Periodic Demand Data," Research Report 2018010, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    13. Antonis Economou & Spyridoula Kanta, 2011. "Equilibrium customer strategies and social–profit maximization in the single‐server constant retrial queue," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(2), pages 107-122, March.
    14. 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.
    15. Niño-Mora, José, 2012. "Towards minimum loss job routing to parallel heterogeneous multiserver queues via index policies," European Journal of Operational Research, Elsevier, vol. 220(3), pages 705-715.
    16. 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.
    17. Antonis Economou & Athanasia Manou, 2013. "Equilibrium balking strategies for a clearing queueing system in alternating environment," Annals of Operations Research, Springer, vol. 208(1), pages 489-514, September.
    18. Christian Larsen, 2017. "Inventory control with and without deliveries in several pieces," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 607-622, March.
    19. Wang, Jinting & Zhang, Feng, 2013. "Strategic joining in M/M/1 retrial queues," European Journal of Operational Research, Elsevier, vol. 230(1), pages 76-87.
    20. Olga Bountali & Antonis Economou, 2019. "Equilibrium threshold joining strategies in partially observable batch service queueing systems," Annals of Operations Research, Springer, vol. 277(2), pages 231-253, June.

    More about this item

    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:wly:navres:v:48:y:2001:i:3:p:201-209. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.