IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v202y2013i1p197-21010.1007-s10479-011-0950-z.html
   My bibliography  Save this article

Dynamic scheduling of a single-server two-class queue with constant retrial policy

Author

Listed:
  • Anastasia Winkler

Abstract

We analyze the non-preemptive assignment of a single server to two infinite-capacity retrial queues. Customers arrive at both queues according to Poisson processes. They are served on first-come-first-served basis following a cost-optimal routing policy. The customer at the head of a queue generates a Poisson stream of repeated requests for service, that is, we have a constant retrial policy. All service times are exponential, with rates depending on the queues. The costs to be minimized consist of costs per unit time that a customer spends in the system. In case of a scheduling problem that arise when no new customers arrive an explicit condition for server allocation to the first or the second queue is given. The condition presented covers all possible parameter choices. For scheduling that also considers new arrivals, we present the conditions under which server assignment to either queue 1 or queue 2 is cost-optimal. Copyright Springer Science+Business Media, LLC 2013

Suggested Citation

  • Anastasia Winkler, 2013. "Dynamic scheduling of a single-server two-class queue with constant retrial policy," Annals of Operations Research, Springer, vol. 202(1), pages 197-210, January.
    • Handle: RePEc:spr:annopr:v:202:y:2013:i:1:p:197-210:10.1007/s10479-011-0950-z
    DOI: 10.1007/s10479-011-0950-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-011-0950-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-011-0950-z?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. Josef Weichbold & Anastasia Winkler, 2010. "Optimal stochastic scheduling in a single server biclass retrial queueing system," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 72(3), pages 405-431, December.
    2. A. Gómez-Corral, 2006. "A bibliographical guide to the analysis of retrial queues through matrix analytic techniques," Annals of Operations Research, Springer, vol. 141(1), pages 163-191, January.
    3. Dimitri frosinin & L. Breuer, 2006. "Threshold policies for controlled retrial queues with heterogeneous servers," Annals of Operations Research, Springer, vol. 141(1), pages 139-162, January.
    4. J. Artalejo, 1999. "A classified bibliography of research on retrial queues: Progress in 1990–1999," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 7(2), pages 187-211, December.
    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. Ioannis Dimitriou, 2016. "A queueing model with two classes of retrial customers and paired services," Annals of Operations Research, Springer, vol. 238(1), pages 123-143, March.
    2. Ioannis Dimitriou, 2016. "A queueing model with two classes of retrial customers and paired services," Annals of Operations Research, Springer, vol. 238(1), pages 123-143, March.
    3. Alexander Moiseev & Maria Shklennik & Evgeny Polin, 2023. "Infinite-server queueing tandem with Markovian arrival process and service depending on its state," Annals of Operations Research, Springer, vol. 326(1), pages 261-279, July.
    4. Dmitry Efrosinin & Natalia Stepanova & Janos Sztrik, 2023. "Robustness of the cμ -Rule for an Unreliable Single-Server Two-Class Queueing System with Constant Retrial Rates," Mathematics, MDPI, vol. 11(18), pages 1-14, September.

    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. Ioannis Dimitriou, 2016. "A queueing model with two classes of retrial customers and paired services," Annals of Operations Research, Springer, vol. 238(1), pages 123-143, March.
    2. Kim, Chesoong & Klimenok, Valentina I. & Orlovsky, Dmitry S., 2008. "The BMAP/PH/N retrial queue with Markovian flow of breakdowns," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1057-1072, September.
    3. Efrosinin, Dmitry & Winkler, Anastasia, 2011. "Queueing system with a constant retrial rate, non-reliable server and threshold-based recovery," European Journal of Operational Research, Elsevier, vol. 210(3), pages 594-605, May.
    4. Ioannis Dimitriou, 2016. "A queueing model with two classes of retrial customers and paired services," Annals of Operations Research, Springer, vol. 238(1), pages 123-143, March.
    5. Sanga, Sudeep Singh & Jain, Madhu, 2019. "Cost optimization and ANFIS computing for admission control of M/M/1/K queue with general retrial times and discouragement," Applied Mathematics and Computation, Elsevier, vol. 363(C), pages 1-1.
    6. Chesoong Kim & Valentina Klimenok & Alexander Dudin, 2014. "A G/M/1 retrial queue with constant retrial rate," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 509-529, July.
    7. Srinivas R. Chakravarthy & Alexander N. Dudin & Sergey A. Dudin & Olga S. Dudina, 2023. "Queueing System with Potential for Recruiting Secondary Servers," Mathematics, MDPI, vol. 11(3), pages 1-24, January.
    8. Se Won Lee & Bara Kim & Jeongsim Kim, 2022. "Analysis of the waiting time distribution in M/G/1 retrial queues with two way communication," Annals of Operations Research, Springer, vol. 310(2), pages 505-518, March.
    9. Samira Taleb & Amar Aissani, 2016. "Preventive maintenance in an unreliable M/G/1 retrial queue with persistent and impatient customers," Annals of Operations Research, Springer, vol. 247(1), pages 291-317, December.
    10. Wee Meng Yeo & Xue-Ming Yuan & Joyce Mei Wan Low, 2017. "On $$M^{X}/G(M/H)/1$$ M X / G ( M / H ) / 1 retrial system with vacation: service helpline performance measurement," Annals of Operations Research, Springer, vol. 248(1), pages 553-578, January.
    11. Jeongsim Kim & Bara Kim, 2016. "A survey of retrial queueing systems," Annals of Operations Research, Springer, vol. 247(1), pages 3-36, December.
    12. Bin Liu & Jie Min & Yiqiang Q. Zhao, 2023. "Refined tail asymptotic properties for the $$M^X/G/1$$ M X / G / 1 retrial queue," Queueing Systems: Theory and Applications, Springer, vol. 104(1), pages 65-105, June.
    13. Lamia Lakaour & Djamil Aïssani & Karima Adel-Aissanou & Kamel Barkaoui, 2019. "M/M/1 Retrial Queue with Collisions and Transmission Errors," Methodology and Computing in Applied Probability, Springer, vol. 21(4), pages 1395-1406, December.
    14. Gao, Shan & Wang, Jinting, 2014. "Performance and reliability analysis of an M/G/1-G retrial queue with orbital search and non-persistent customers," European Journal of Operational Research, Elsevier, vol. 236(2), pages 561-572.
    15. E. Lerzan Örmeci & Evrim Didem Güneş & Derya Kunduzcu, 2016. "A Modeling Framework for Control of Preventive Services," Manufacturing & Service Operations Management, INFORMS, vol. 18(2), pages 227-244, May.
    16. B. Krishna Kumar & R. Sankar & R. Navaneetha Krishnan & R. Rukmani, 2022. "Performance Analysis of Multi-processor Two-Stage Tandem Call Center Retrial Queues with Non-Reliable Processors," Methodology and Computing in Applied Probability, Springer, vol. 24(1), pages 95-142, March.
    17. Wang, Jinting & Liu, Bin & Li, Jianghua, 2008. "Transient analysis of an M/G/1 retrial queue subject to disasters and server failures," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1118-1132, September.
    18. Bara Kim & Jeongsim Kim, 2016. "Analysis of the $$M^X/G/1$$ M X / G / 1 retrial queue," Annals of Operations Research, Springer, vol. 247(1), pages 193-210, December.
    19. Dudin, A. N. & Krishnamoorthy, A. & Joshua, V. C. & Tsarenkov, G. V., 2004. "Analysis of the BMAP/G/1 retrial system with search of customers from the orbit," European Journal of Operational Research, Elsevier, vol. 157(1), pages 169-179, August.
    20. Lyes Ikhlef & Ouiza Lekadir & Djamil Aïssani, 2016. "MRSPN analysis of Semi-Markovian finite source retrial queues," Annals of Operations Research, Springer, vol. 247(1), pages 141-167, December.

    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:202:y:2013:i:1:p:197-210:10.1007/s10479-011-0950-z. 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.