[1] Cachon G, Terwiesch C. Matching supply with demand:An introduction to operations management (3rd Edition)[M]. New York:Mcgraw-Hill Irwin Press, 2012. [2] Afèche P. Incentive-compatible revenue management in queueing systems:Optimal strategic delay[J]. Manufacturing & Service Operations Management, 2013, 15(3):423-443. [3] Afèche P, Sarhangian V. Rational abandonment from priority queues:Equilibrium strategy and pricing implications[J]. Working Paper, University of Toronto, 2015. [4] Atar R, Giat C, Shimkin N. The cμ/θ rule for many-server queues with abandonment[J]. Operations Research, 2012, 58(5):1427-1439. [5] Smith W E. Various optimizers for single-stage production[J]. Naval Research Logistics Quarterly, 1956, 3(1-2):59-66. [6] Cox D R, Smith W L. Queues[M]. London:Methuen Press, 1961. [7] Pinedo M. Stochastic scheduling with release dates and due dates[J]. Operations Research, 1983, 31(3):559-572. [8] Van Mieghem J A. Dynamic scheduling with convex delay costs:The generalized cμ rule[J]. Annals of Applied Probability, 1995, 5(3):809-833. [9] Afèche P, Pavlin J M. Optimal price/lead-time menus for queues with customer choice:Segmentation, pooling, and strategic delay[J]. Management Science, 2016, 62(8):2412-2436. [10] Ward A R, Armony M. Blind fair routing in large-scale service systems with heterogeneous customers and servers[J]. Operations Research, 2013, 61(1):228-243. [11] Gavirneni S, Kulkarni V G. Self-selecting priority queues with burr distributed waiting costs[J]. Production and Operations Management, 2016, 25(6):979-992. [12] Nazerzadeh H, Randhawa R S. Near-optimality of coarse service grades for customer differentiation in queueing systems[J]. Production and Operations Management, 2018, 27(3):578-595. [13] Kleinrock L. Queueing systems. Volume 1:Theory[M]. New York:Wiley Interscience Press, 1975. [14] Hassin R. Rational queueing[M]. Boca Raton, FL:CRC Press, Taylor & Francis Group, 2016. [15] Hassin R, Haviv M.To queue or not to queue:Equilibrium behavior in queueing systems[M]. Boston, Springer, 2012. [16] Norman D A. The psychology of waiting lines:Sociable design[M/OL]. 2008.http://www.jnd.org/dn.mss/sociable_design_intr.html. [17] Rafaeli A, Kedmi E, Vashdi D, et al. Queues and fairness:A multiple study experimental investigation[R]. Technical Report, 2005. [18] Alexander M, MacLaren A, O'Gorman K, et al. Priority queues:Where social justice and equity collide[J]. Tourism Management, 2012,33(4):875-884. [19] Aliyah T. Why waiting is torture[N/OL]. The New York Times, August 19, 2012. [20] Larson R C. Perspectives on queues:Social justice and the psychology of queueing[J]. Operations Research, 1987, 35(6):895-905. [21] Wang J F, Baron O, Scheller-Wolf A. M/M/c queue with two priority classes[J]. Operations Research, 2015, 63(3):733-749. [22] Avi-itzhak B, Levy H, Raz D. Quantifying fairness in queuing systems:Principles, approaches, and applicability[J]. Probability in the Engineering and Informational Sciences, 2008, 22(4):495-517. [23] Lariviere M. How should a supermarket organize its checkout lanes?[EB/OL]. Kellogg insight presents, 2014. https://operationsroom.wordpress.com/2014/10/17/how-should-a-supermarket-organize-its-checkout-lanes/. [24] Geng X, Huh W T, Nagarajan M. Fairness among servers when capacity decisions are endogenous[J]. Production and Operations Management, 2015, 24(6):961-974. [25] Kleinrock L. Optimum bribing for queue position[J]. Operations Research, 1967, 15(2):304-318. [26] Bassamboo A, Randhawa R S. Scheduling homogeneous impatient customers[J]. Management Science, 2016, 62(6):129-2147. [27] Choi B D, Kim B, Chung J M. M/M/1queue with impatient customers of higher priority[J]. Queueing Systems, 2001, 38(1):49-66. [28] Iravani F, Balcıogg~lu B. On priority queues with impatient customers[J]. Queueing Systems, 2008, 58(4):239-260. [29] Afèche P, Mendelson H. Pricing and priority auctions in queuing systems with a generalized delay cost structure[J]. Management Science, 2004, 50(7):869-882. [30] Debo L G, Rajan U, Veeraraghavan S K. Signaling by price in a congested environment[J]. Working paper, University of Chicago, 2012. [31] 唐应辉, 兰绍军. N-策略与Min(N,V)-策略的M/G/1/∞排队系统等待时间的随机分解结构[J]. 系统工程理论与实践, 2016, 36(1):174-183. [32] Yang L, Guo P F, Wang Y L. Service pricing with loss averse customers[J]. Operations Research, 2018, 66(3):761-777. [33] 刘健, 赵洪款, 刘思峰. 基于顾客不公平规避的服务定价研究[J].中国管理科学, 2018, 26(2):46-53. [34] Gross D, Harris M C. Fundamentals of queueing theory (3rd Edition)[M]. New York:Wiley Press, 1998. [35] Medhi J. Stochastic models in queueing theory (2nd Edition)[M]. Boston:Academic Press,2002. |