IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v223y2012i1p123-132.html
   My bibliography  Save this article

A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline

Author

Listed:
  • Bruneel, Herwig
  • Mélange, Willem
  • Steyaert, Bart
  • Claeys, Dieter
  • Walraevens, Joris

Abstract

This paper considers a simple discrete-time queueing model with two types (classes) of customers (types 1 and 2) each having their own dedicated server (servers A and B resp.). New customers enter the system according to a general independent arrival process, i.e., the total numbers of arrivals during consecutive time slots are i.i.d. random variables with arbitrary distribution. Service times are deterministically equal to 1 slot each. The system uses a “global FCFS” service discipline, i.e., all arriving customers are accommodated in one single FCFS queue, regardless of their types. As a consequence of the “global FCFS” rule, customers of one type may be blocked by customers of the other type, in that they may be unable to reach their dedicated server even at times when this server is idle, i.e., the system is basically non-workconserving. One major aim of the paper is to estimate the negative impact of this phenomenon on the queueing performance of the system, in terms of the achievable throughput, the system occupancy, the idle probability of each server and the delay. As it is clear that customers of different types hinder each other more as they tend to arrive in the system more clustered according to class, the degree of “class clustering” in the arrival process is explicitly modeled in the paper and its very direct impact on the performance measures is revealed. The motivation of our work are systems where this kind of blocking is encountered, such as input-queueing network switches or road splits.

Suggested Citation

  • Bruneel, Herwig & Mélange, Willem & Steyaert, Bart & Claeys, Dieter & Walraevens, Joris, 2012. "A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline," European Journal of Operational Research, Elsevier, vol. 223(1), pages 123-132.
    • Handle: RePEc:eee:ejores:v:223:y:2012:i:1:p:123-132
    DOI: 10.1016/j.ejor.2012.06.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712004869
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.06.031?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. Maertens, Tom & Walraevens, Joris & Bruneel, Herwig, 2007. "A modified HOL priority scheduling discipline: Performance analysis," European Journal of Operational Research, Elsevier, vol. 180(3), pages 1168-1185, August.
    2. Avishai Mandelbaum & Martin I. Reiman, 1998. "On Pooling in Queueing Networks," Management Science, INFORMS, vol. 44(7), pages 971-981, July.
    3. Tom Van Woensel & Nico Vandaele, 2007. "Modeling Traffic Flows With Queueing Models: A Review," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(04), pages 435-461.
    4. Laevens, Koenraad & Bruneel, Herwig, 1995. "Delay analysis for discrete-time queueing systems with multiple randomly interrupted servers," European Journal of Operational Research, Elsevier, vol. 85(1), pages 161-177, August.
    5. Frank N. Gouweleeuw & Henk C. Tijms, 1998. "Computing Loss Probabilities in Discrete-Time Queues," Operations Research, INFORMS, vol. 46(1), pages 149-154, 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. Tao Jiang, 2018. "Analysis of a Tollbooth Tandem Queue with Two-Class Customers and Two Heterogeneous Dedicated Servers," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(06), pages 1-21, December.
    2. Baoxian Chang & Tao Jiang & Qingqing Ye & Xudong Chai & Liwei Liu, 2020. "Analysis of Tollbooth Systems with Two Tandem Skill-Based Servers and Two Vehicle Types," Methodology and Computing in Applied Probability, Springer, vol. 22(3), pages 1145-1167, September.
    3. Jens Baetens & Bart Steyaert & Dieter Claeys & Herwig Bruneel, 2020. "System occupancy in a multiclass batch-service queueing system with limited variable service capacity," Annals of Operations Research, Springer, vol. 293(1), pages 3-26, October.
    4. Herwig Bruneel & Willem Mélange & Dieter Claeys & Joris Walraevens, 2017. "A two-class global FCFS discrete-time queueing model with arbitrary-length constant service times," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 164-178, April.
    5. Baoxian Chang & Qingqing Ye & Jun Lv & Tao Jiang, 2019. "Mathematical modelling of a tollbooth system with two parallel skill-based servers and two vehicle types," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(3), pages 479-501, 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. H. Bruneel & W. Rogiest & J. Walraevens & S. Wittevrongel, 2015. "Analysis of a discrete-time queue with general independent arrivals, general service demands and fixed service capacity," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(3), pages 285-315, December.
    2. Herwig Bruneel & Sabine Wittevrongel & Dieter Claeys & Joris Walraevens, 2016. "Discrete-time queues with variable service capacity: a basic model and its analysis," Annals of Operations Research, Springer, vol. 239(2), pages 359-380, April.
    3. Sigrún Andradóttir & Hayriye Ayhan & Douglas G. Down, 2001. "Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems," Management Science, INFORMS, vol. 47(10), pages 1421-1439, October.
    4. Wallace J. Hopp & Eylem Tekin & Mark P. Van Oyen, 2004. "Benefits of Skill Chaining in Serial Production Lines with Cross-Trained Workers," Management Science, INFORMS, vol. 50(1), pages 83-98, January.
    5. Tanja Mlinar & Philippe Chevalier, 2016. "Pooling heterogeneous products for manufacturing environments," 4OR, Springer, vol. 14(2), pages 173-200, June.
    6. Saied Samiedaluie & Vedat Verter, 2019. "The impact of specialization of hospitals on patient access to care; a queuing analysis with an application to a neurological hospital," Health Care Management Science, Springer, vol. 22(4), pages 709-726, December.
    7. Yusei Koyama & Ayane Nakamura & Tuan Phung-Duc, 2024. "Sojourn Time Analysis of a Single-Server Queue with Single- and Batch-Service Customers," Mathematics, MDPI, vol. 12(18), pages 1-27, September.
    8. Freek Verdonck & Herwig Bruneel & Sabine Wittevrongel, 2022. "Delay analysis of a discrete-time single-server queue with an occasional extra server," Annals of Operations Research, Springer, vol. 310(2), pages 551-575, March.
    9. Alessio Pagani & Abhinav Mehrotra & Mirco Musolesi, 2021. "Graph input representations for machine learning applications in urban network analysis," Environment and Planning B, , vol. 48(4), pages 741-758, May.
    10. Noah Gans & Yong-Pin Zhou, 2007. "Call-Routing Schemes for Call-Center Outsourcing," Manufacturing & Service Operations Management, INFORMS, vol. 9(1), pages 33-50, May.
    11. van Oorschot, K.E. & Wang, Yan & Akkermans, Henk, 2018. "Throbbing between two lives : Resource pooling in service supply chains," Other publications TiSEM ca35c4c6-4bec-4d57-aa61-3, Tilburg University, School of Economics and Management.
    12. Osorio, Carolina & Wang, Carter, 2017. "On the analytical approximation of joint aggregate queue-length distributions for traffic networks: A stationary finite capacity Markovian network approach," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 305-339.
    13. Tianxiang Wang & Peiwen Yu & Jianqiang Hu, 2022. "Admission Control Game with Capacity Borrowing," Production and Operations Management, Production and Operations Management Society, vol. 31(2), pages 547-560, February.
    14. Niek Baer & Richard J. Boucherie & Jan-Kees C. W. van Ommeren, 2019. "Threshold Queueing to Describe the Fundamental Diagram of Uninterrupted Traffic," Transportation Science, INFORMS, vol. 53(2), pages 585-596, March.
    15. Suri Gurumurthi & Saif Benjaafar, 2004. "Modeling and analysis of flexible queueing systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(5), pages 755-782, August.
    16. Nilay Tanık Argon & Sigrún Andradóttir, 2017. "Pooling in tandem queueing networks with non-collaborative servers," Queueing Systems: Theory and Applications, Springer, vol. 87(3), pages 345-377, December.
    17. Seyed M. R. Iravani & Bora Kolfal & Mark P. Van Oyen, 2007. "Call-Center Labor Cross-Training: It's a Small World After All," Management Science, INFORMS, vol. 53(7), pages 1102-1112, July.
    18. Tom Maertens & Joris Walraevens & Herwig Bruneel, 2008. "Performance comparison of several priority schemes with priority jumps," Annals of Operations Research, Springer, vol. 162(1), pages 109-125, September.
    19. Oualid Jouini & Yves Dallery & Rabie Nait-Abdallah, 2008. "Analysis of the Impact of Team-Based Organizations in Call Center Management," Management Science, INFORMS, vol. 54(2), pages 400-414, February.
    20. Muhammad El-Taha & Bacel Maddah, 2006. "Allocation of Service Time in a Multiserver System," Management Science, INFORMS, vol. 52(4), pages 623-637, April.

    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:eee:ejores:v:223:y:2012:i:1:p:123-132. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.