Skip to main content
Log in

Mathematical modelling of a tollbooth system with two parallel skill-based servers and two vehicle types

  • Original Paper
  • Published:
TOP Aims and scope Submit manuscript

Abstract

This paper considers a tollbooth system with two parallel heterogeneous servers and two vehicle types (say, cars and trucks), where one server collects tolls from vehicles of both types and the other only serves one type of them. With such characteristic, the system is referred to as “skill-based servers” for brevity in this paper. Meanwhile, vehicles are accommodated in a single common lane and get served on the “global First-Come-First-Served” basis. In fact, such a system and its variants are commonly encountered and their performance measures are of great significance to managers. We first develop a Quasi-Birth-Death process to explicitly model this tollbooth system. Then by applying spectral expansion technique, we derive the stationary probabilities for the computation of the system’s performance measures, such as mean queue size and the idle probability of each server. The Laplace–Stieltjes transforms of an arbitrary vehicle’s sojourn time is derived as well. Finally, numerical results are presented to show the impact of parameters’ selection upon performance measures, and they have intriguing managerial implications. The results also reveal that the tollbooth system with skill-based servers is much more efficient compared to the system with dedicated servers, which has been studied by Mélange et al. (Comput Oper Res 71:23–33, 2016), especially in rush hours.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  • Bruneel H, Mélange W, Steyaert B, Claeys D, Walraevens J (2012) A two-class discrete-time queueing model with two dedicated servers and global FCFS service discipline. Eur J Oper Res 223(1):123–132

    Article  Google Scholar 

  • Bruneel H, Mélange W, Steyaert B, Claeys D, Walraevens J (2013) Effect of global FCFS and relative load distribution in two-class queues with dedicated servers. 4OR Q J Oper Res 11(4):375–391

    Article  Google Scholar 

  • Bruneel H, Mélange W, Claeys D, Walraevens J (2017) A two-class global FCFS discrete-time queueing model with arbitrary-length constant service times. Top 25(1):164–178

    Article  Google Scholar 

  • Bruneel H, Mélange W, Walraevens J, De Vuyst S, Claeys D (2017) Performance analysis of a discrete-time two-class global-FCFS queue with two servers and geometric service times. Perform Eval 109:34–51

    Article  Google Scholar 

  • Chakka R (1995) Performance and reliability modelling of computing systems using spectral expansion. Ph.D. Thesis, University of Newcastle upon Tyne, Newcastle upon Tyne

  • Chao X, He Q-M, Ross S (2015) Tollbooth tandem queues with infinite homogeneous servers. J Appl Prob 52:941–961

    Article  Google Scholar 

  • Conor Friedersdorf (2010) TSA Pat-Down Policy: Gender vs. Security. https://www.thedailybeast.com/tsa-pat-down-policy-gender-vs-security. Accessed 17 June 2019

  • Do TV (2015) A closed-form solution for a toll booth tandem queue with two heterogeneous servers and exponential service times. Eur J Oper Res 247:672–675

    Article  Google Scholar 

  • Evans RV (1967) Geometric distribution in some two-dimensional queueing systems. Oper Res 15:830–846

    Article  Google Scholar 

  • Harrison JM, López MJ (1999) Heavy traffic resource pooling in parallel-server systems. Queueing Syst 33:339–368

    Article  Google Scholar 

  • Haverkort B, Ost A (1997) Steady state analysis of infinite stochastic Petri nets: a comparing between the spectral expansion and the matrix geometric method. In: 7th International Workshop on Petri Nets and Performance models, pp 335–346

  • He Q-M, Chao X (2014) A tollbooth tandem queue with heterogeneous servers. Eur J Oper Res 236(1):177–189

    Article  Google Scholar 

  • INRIX (2017) Los Angeles tops INRIX global congestion ranking. http://inrix.com/press-releases/los-angeles-tops-inrix-global-congestion-ranking. INRIX

  • Jain S, Smith MG (1994) Open finite queueing networks with M/M/C/K parallel servers. Comput Oper Res 21(3):297–317

    Article  Google Scholar 

  • Jiang T, Liu L (2017) Analysis of a two-class continuous-time queueing model with two tandem dedicated servers. RAIRO Oper Res 51(4):945–963

    Article  Google Scholar 

  • Latouche G, Ramaswami V (1999) Introduction to matrix analytic methods in stochastic modeling. ASA-SIAM Series on Statistics and Applied Probability, Philadelphia

    Book  Google Scholar 

  • Mandelbaum A, Reiman M (1988) On pooling in queueing networks. Manag Sci 44(7):971–981

    Article  Google Scholar 

  • Mélange W, Bruneel H, Steyaert B, Claeys D, Walraevens J (2014) A continuous-time queueing model with class clustering and global FCFS service discipline. J Ind Manag Optim 10(1):193–206

    Google Scholar 

  • Mélange W, Walraevens J, Claeys D, Steyaert B, Bruneel H (2016) The impact of a global FCFS service discipline in a two-class queue with dedicated servers. Comput Oper Res 71:23–33

    Article  Google Scholar 

  • Mitrani I, Chakka R (1995) Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method. Perform Eval 23(3):241–260

    Article  Google Scholar 

  • Neuts MF (1981) Matrix-geometric solutions in stochastic models: algorithmic approach. Johns Hopkins University Press, Baltimore

    Google Scholar 

  • Thomopoulos NT (2012) Fundamentals of queuing systems. Springer, New York

    Book  Google Scholar 

  • Visschers J, Adan I, Weiss G (2012) A product form solution to a system with multi-type jobs and multi-type servers. Queueing Syst 70:269–298

    Article  Google Scholar 

  • Wallace VL (1969) The solution of Quasi birth and death processes arising from multiple access computer systems. Ph.D. Thesis, University of Michigan

  • Wallace R, Whitt W (2005) A staffing algorithm for call centers with skill-based routing. Manuf Serv Oper Mang 7(4):276–294

    Article  Google Scholar 

  • Wu R, Down DG (2008) Round robin scheduling of heterogeneous parallel servers in heavy traffic. Eur J Oper Res 195:372–380

    Article  Google Scholar 

  • Zhao Y-Q, Grassman WK (1995) Queueing analysis of a jockeying model. Oper Res 43:520–529

    Article  Google Scholar 

Download references

Acknowledgements

The research was supported by National Natural Science Foundation of China under Grant no. 61773014, partially supported by National Natural Science Foundation of China under Grant no. 61501224 and Shandong Provincial Natural Science Foundation (China) under Grant no. ZR2019BG014.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tao Jiang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chang, B., Ye, Q., Lv, J. et al. Mathematical modelling of a tollbooth system with two parallel skill-based servers and two vehicle types. TOP 27, 479–501 (2019). https://doi.org/10.1007/s11750-019-00524-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11750-019-00524-2

Keywords

Mathematics Subject Classification

Navigation