Supermarket Application Based on Queueing Theory

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 218)


In order to better reduce the operation cost of Beidaihe small supermarket, especially the reasonable arrangement of the cashier of a number, we can use the queueing theory to solve this question. Queueing theory is the theory of random service system, based on the service object and the arrival of business hours of the statistical study, draws some quantitative indices (waiting time, queue length, busy period length) statistical regularity. Supermarket operators in order to facilitate the purchase installed large number of tourists pay POS machine, to reduce the customer waiting time. Introduction of excess POS will increase the cost of the supermarket operators. Use queue theory by comparing the calculated cash and credit card payment waiting time. With the results of guided supermarket operator reasonable arrangement of POS machine number.


Queueing theory Utilization rate 


  1. 1.
    Lai LC (1993) Queuing theory. Beijing Inst Posts Telecommun Press 15:143–148Google Scholar
  2. 2.
    Zhiheng S, Jianping L (2005) Fundamentals of queueing theory. Sci Press 8:35–113Google Scholar
  3. 3.
    Zhixue W (2008) Management operational research in Beijing the publishing house of electronics industry 3(4):89–94Google Scholar
  4. 4.
    Xierui L, ChengZhang X, Lianfen L, Xieqiang M (2009) The thought of mathematical modeling and the university mathematics teaching integration. Chin Adult Educ 17:129–130Google Scholar
  5. 5.
    Arik S (2003) An analysis of exponential stability of delayed neural networks with time varying delays. Neural Netw 17:1027–1031CrossRefGoogle Scholar
  6. 6.
    Chiang JH, Yuan J (2000) Optimal maintenance policy for a production system subject to ageing and shocks. J Qual Maint Eng 6:200–216CrossRefGoogle Scholar
  7. 7.
    Zhang Q, Wei X, Jin X (2003) Global asymptotic stability of Hopfield neural networks with transmission delays. Phys Lett 318:399–405MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    Cao J, Wang J (2003) Global asymptotic stability of a general class of recurrent neural networks with time-varying delays. IEEE Trans Circ Syst I: Fundam Theory Appl 50:34–44MathSciNetCrossRefGoogle Scholar
  9. 9.
    Wang K, Su Q, Li C Study (2009) On priority queuing during cell scheduling. Commun Technol, 42(11):133–137Google Scholar
  10. 10.
    Hou D (2009) Feedback priority of M/M/1 queueing system for captain analysis. J Shandong Univ Technol Nat Sci Edn 23(3):4–7Google Scholar
  11. 11.
    Bian J, Yin W (2010) M/G/1 feedback under non preemptive priority discipline queuing system preliminary analysis. J Jianghan Univ Nat Sci Edn 38(1):8–9Google Scholar
  12. 12.
    Wei L, Liu Z (2009) Applying queuing theory to quantitative analysis on outpatient billing service in hospital. Chin Med Equip J 10:56–57Google Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  1. 1.Department of Basic CoursesQinhuangdao Institute of TechnologyQinhuangdaoChina

Personalised recommendations