IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v198y2012i1p5-2310.1007-s10479-010-0758-2.html
   My bibliography  Save this article

A polling model with reneging at polling instants

Author

Listed:
  • M. Boon

Abstract

In this paper we consider a single-server, cyclic polling system with switch-over times and Poisson arrivals. The service disciplines that are discussed, are exhaustive and gated service. The novel contribution of the present paper is that we consider the reneging of customers at polling instants. In more detail, whenever the server starts or ends a visit to a queue, some of the customers waiting in each queue leave the system before having received service. The probability that a certain customer leaves the queue, depends on the queue in which the customer is waiting, and on the location of the server. We show that this system can be analysed by introducing customer subtypes, depending on their arrival periods, and keeping track of the moment when they abandon the system. In order to determine waiting time distributions, we regard the system as a polling model with varying arrival rates, and apply a generalised version of the distributional form of Little’s law. The marginal queue length distribution can be found by conditioning on the state of the system (position of the server, and whether it is serving or switching). Copyright The Author(s) 2012

Suggested Citation

  • M. Boon, 2012. "A polling model with reneging at polling instants," Annals of Operations Research, Springer, vol. 198(1), pages 5-23, September.
    • Handle: RePEc:spr:annopr:v:198:y:2012:i:1:p:5-23:10.1007/s10479-010-0758-2
    DOI: 10.1007/s10479-010-0758-2
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-010-0758-2
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-010-0758-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
    ---><---

    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. 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.
    2. Martin Eisenberg, 1972. "Queues with Periodic Service and Changeover Time," Operations Research, INFORMS, vol. 20(2), pages 440-451, April.
    3. Ger Koole & Avishai Mandelbaum, 2002. "Queueing Models of Call Centers: An Introduction," Annals of Operations Research, Springer, vol. 113(1), pages 41-59, July.
    4. David Assaf & Moshe Haviv, 1990. "Reneging from Processor Sharing Systems and Random Queues," Mathematics of Operations Research, INFORMS, vol. 15(1), pages 129-138, 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. Vladimir Vishnevsky & Olga Semenova, 2021. "Polling Systems and Their Application to Telecommunication Networks," Mathematics, MDPI, vol. 9(2), pages 1-30, January.
    2. Kevin Granville & Steve Drekic, 2019. "On a 2-class polling model with reneging and $$k_i$$ k i -limited service," Annals of Operations Research, Springer, vol. 274(1), pages 267-290, March.
    3. Ravi Suman & Ananth Krishnamurthy, 2020. "Analysis of tandem polling queues with finite buffers," Annals of Operations Research, Springer, vol. 293(1), pages 343-369, October.

    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. 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.
    2. Dimitris Bertsimas & José Niño-Mora, 1996. "Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case," Economics Working Papers 302, Department of Economics and Business, Universitat Pompeu Fabra, revised Jul 1998.
    3. Ioannis Dimitriou, 2013. "A preemptive resume priority retrial queue with state dependent arrivals, unreliable server and negative customers," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 542-571, October.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Benjamin Legros & Sihan Ding & Rob Mei & Oualid Jouini, 2017. "Call centers with a postponed callback offer," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1097-1125, October.
    12. 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.
    13. Tkachenko Andrey, 2013. "Multichannel queuing systems with balking and regenerative input fl ow," HSE Working papers WP BRP 14/STI/2013, National Research University Higher School of Economics.
    14. Mehmet Tolga Cezik & Pierre L'Ecuyer, 2008. "Staffing Multiskill Call Centers via Linear Programming and Simulation," Management Science, INFORMS, vol. 54(2), pages 310-323, February.
    15. Saffer, Zsolt & Telek, Miklós, 2009. "Stability of periodic polling system with BMAP arrivals," European Journal of Operational Research, Elsevier, vol. 197(1), pages 188-195, August.
    16. Ioannis Dimitriou, 2016. "Queueing analysis of the DRX power saving mechanism in fault-tolerant 3GPP LTE wireless networks," Annals of Operations Research, Springer, vol. 239(2), pages 521-552, April.
    17. Yi Peng & Jinbiao Wu, 2020. "A Lévy-Driven Stochastic Queueing System with Server Breakdowns and Vacations," Mathematics, MDPI, vol. 8(8), pages 1-12, July.
    18. Eduardo González & Leonardo Epstein & Verónica Godoy, 2012. "Optimal number of bypasses: minimizing cost of calls to wireless phones under Calling Party Pays," Annals of Operations Research, Springer, vol. 199(1), pages 179-191, October.
    19. Jianjun Li & Liwei Liu & Tao Jiang, 2018. "Analysis of an M/G/1 queue with vacations and multiple phases of operation," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 51-72, February.
    20. Reynold E. Byers & Kut C. So, 2007. "Note--A Mathematical Model for Evaluating Cross-Sales Policies in Telephone Service Centers," Manufacturing & Service Operations Management, INFORMS, vol. 9(1), pages 1-8, January.

    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:annopr:v:198:y:2012:i:1:p:5-23:10.1007/s10479-010-0758-2. 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.