Exploiting market size in service systems

Manufacturing and Service Operations Management

Volumn 12, Issue 3, 2010, Pages 511-526

  Kumar, Sunil ^a   Randhawa, Ramandeep S ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Capacity planning; Convex delay costs; Large market size; Nonlinear delay costs; Pricing; Service systems

Indexed keywords

CAPACITY DECISIONS; CAPACITY PLANNING; DELAY COSTS; DELAY SENSITIVE; MARKET SIZES; POTENTIAL MARKETS; PRICING SERVICES; PROFIT-MAXIMIZING FIRMS; SCALE ECONOMIES; SCHEDULING POLICIES; SERVICE SYSTEMS;

COMMERCE; CUSTOMER SATISFACTION; ECONOMICS; PROFITABILITY; SALES;

COSTS;

EID: 77954584246     PISSN: 15234614     EISSN: 15265498     Source Type: Journal    
DOI: 10.1287/msom.1090.0282     Document Type: Article

References (26)

1. Armony, M. 2005. Dynamic routing in large-scale service systems with heterogeneous servers. Queueing Systems: Theory Appl. 51 287-329.
2. Asmussen, S. 2003. Applied Probability and Queues, 2nd ed. Springer-Verlag, New York.
3. Ata, B., T. L. Olsen. 2009. Near-optimal dynamic leadtime quotation and scheduling under convex-concave customer delay costs. Oper. Res. 57(3)753-768.
4. Borst, S., A. Mandelbaum, M. Reiman. (2004). Dimensioning large call centers. Oper. Res. 52(1)17-34.
5. Chan, W.-C., Y.-B. Lin. 2003. Waiting time distribution for the M/M/m queue. IEE Proc. Commun. 150(3)159-162.
6. Dai, J. G., W. Lin. 2008. Asymptotic optimality of maximum pressure policies in stochastic processing networks. Ann. Appl. Probab. 18(6)2239-2299.
7. Gans, N., G. Koole, A. Mandelbaum. 2003. Telephone call centers: Tutorial review and research prospects. Manufacturing Service Oper. Management 5(2)79-141.
8. Garnett, O., A. Mandelbaum, M. Reiman. 2002. Designing a call center with impatient customers. Manufacturing Service Oper. Management 4(3)208-227.
9. Gurvich, I., W. Whitt. 2008. Scheduling flexible servers with convex delay costs in many-server service systems. Manufacturing Service Oper. Management 11(2)237-253.
10. Halfin, S., W. Whitt. 1981. Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29 567-588.
11. Hassin, R., M. Haviv. 2003. To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems. International Series in Operations Research and Management Science. Kluwer Academic Publishers, Norwell, MA.
12. Kingman, J. F. C. 1961. The single server queue in heavy traffic. Proc. Cambridge Phil. Soc. 57 902-904.
13. Li, J. 1996. From FIFO to LIFO: A functional ordering of service delay via arrival discipline. J. Appl. Probab. 33(2)507-512.
14. Maglaras, C., A. Zeevi. 2003. Pricing and capacity sizing for systems with shared resources: Approximate solutions and scaling relations. Management Sci. 49 1018-1038.
15. Maglaras, C., A. Zeevi. 2005. Pricing and design of differentiated services: Approximate analysis and structural insights. Oper. Res. 53 242-262.
16. Mandelbaum, A., A. L. Stolyar. 2004. Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized c μ-rule. Oper. Res. 52(6)836-855.
17. Naor, P. 1969. The regulation of queue sizes by levying tolls. Econometrica 37 15-24.
18. Plambeck, E. L., A. R. Ward. 2006. Optimal control of a high-volume assemble-to-order system. Math. Oper. Res. 31 453-477.
19. Randhawa, R. S., S. Kumar. 2008. Usage restriction and subscription services: Operational benefits with rational users. Manufacturing Service Oper. Management 10(3)429-447.
20. Schrage, L. E., L. Miller. 1966. The queue M/G/1 with the shortest remaining processing time discipline. Oper. Res. 14(4)670-684.
21. Stolyar, A. L. 2004. Maxweight scheduling in a generalized switch: State space collapse and equivalent workload minimization under complete resource pooling. Ann. Appl. Probab. 14(1)1-53.
22. Tezcan, T. 2008. Optimal control of distributed parallel server systems under the Halfin and Whitt regime. Math. Oper. Res. 33(1)51-90.
23. Van Mieghem, J. A. 1995. Dynamic scheduling with convex delay costs: The generalized cμ rule. Ann. Appl. Probab. 5(3)808-833.
24. Whitt, W. 1993. Approximations for the GI/G/m queue. Production Oper. Managment 2(2)114-161.
25. Whitt, W. 2003. How multiserver queues scale with growing congestion-dependent demand. Oper. Res. 51(4)531-542.
26. Wierman, A. 2007. Scheduling for today's computer systems: Bridging theory and practice. Ph. D. thesis, Carnegie Mellon University, Pittsburgh.