Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Exploiting Market Size in Service Systems

Exploiting Market Size in Service Systems We study a profit-maximizing firm providing a service to price and delay sensitive customers. We are interested in analyzing the scale economies inherent in such a system. In particular, we study how the firm's pricing and capacity decisions change as the scale, measured by the potential market for the service, increases. These decisions turn out to depend intricately on the form of the delay costs seen by the customers; we characterize these decisions up to the dominant order in the scale for both convex and concave delay costs. We show that when serving customers on a first-come, first-served basis, if the customers' delay costs are strictly convex, the firm can increase its utilization and extract profits beyond what it can do when customers' delay costs are linear. However, with concave delay costs, the firm is forced to decrease its utilization and makes less profit than in the linear case. While studying concave delay costs, we demonstrate that these decisions depend on the scheduling policy employed as well. We show that employing the last-come, first-served rule in the concave case results in utilization and profit similar to the linear case, regardless of the actual form of the delay costs. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Manufacturing & Service Operations Management INFORMS

Exploiting Market Size in Service Systems

Download PDF
16 pages

Loading next page...
 
/lp/informs/exploiting-market-size-in-service-systems-0ZCfH09ztD

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Research Article
ISSN
1523-4614
eISSN
1526-5498
DOI
10.1287/msom.1090.0282
Publisher site
See Article on Publisher Site

Abstract

We study a profit-maximizing firm providing a service to price and delay sensitive customers. We are interested in analyzing the scale economies inherent in such a system. In particular, we study how the firm's pricing and capacity decisions change as the scale, measured by the potential market for the service, increases. These decisions turn out to depend intricately on the form of the delay costs seen by the customers; we characterize these decisions up to the dominant order in the scale for both convex and concave delay costs. We show that when serving customers on a first-come, first-served basis, if the customers' delay costs are strictly convex, the firm can increase its utilization and extract profits beyond what it can do when customers' delay costs are linear. However, with concave delay costs, the firm is forced to decrease its utilization and makes less profit than in the linear case. While studying concave delay costs, we demonstrate that these decisions depend on the scheduling policy employed as well. We show that employing the last-come, first-served rule in the concave case results in utilization and profit similar to the linear case, regardless of the actual form of the delay costs.

Journal

Manufacturing & Service Operations Management – INFORMS

Published: Jul 22, 2010

Keywords: Keywords : service systems ; pricing ; capacity planning ; large market size ; nonlinear delay costs ; convex delay costs

References

  • Dynamic routing in large-scale service systems with heterogeneous servers
    Armony, M.
  • Near-optimal dynamic leadtime quotation and scheduling under convex-concave customer delay costs
    Ata, B.; Olsen, T. L.
  • Dimensioning large call centers
    Borst, S.; Mandelbaum, A.; Reiman, M.
  • Waiting time distribution for the M/M/m queue
    Chan, W.-C.; Lin, Y.-B.
  • Asymptotic optimality of maximum pressure policies in stochastic processing networks
    Dai, J. G.; Lin, W.
  • Telephone call centers: Tutorial review and research prospects
    Gans, N.; Koole, G.; Mandelbaum, A.
  • Designing a call center with impatient customers
    Garnett, O.; Mandelbaum, A.; Reiman, M.
  • Scheduling flexible servers with convex delay costs in many-server service systems
    Gurvich, I.; Whitt, W.
  • Heavy-traffic limits for queues with many exponential servers
    Halfin, S.; Whitt, W.
  • The single server queue in heavy traffic
    Kingman, J. F. C.
  • From FIFO to LIFO: A functional ordering of service delay via arrival discipline
    Li, J.
  • Pricing and capacity sizing for systems with shared resources: Approximate solutions and scaling relations
    Maglaras, C.; Zeevi, A.
  • Pricing and design of differentiated services: Approximate analysis and structural insights
    Maglaras, C.; Zeevi, A.
  • Scheduling flexible servers with convex delay costs: Heavy-traffic optimality of the generalized c-rule
    Mandelbaum, A.; Stolyar, A. L.
  • The regulation of queue sizes by levying tolls
    Naor, P.
  • Optimal control of a high-volume assemble-to-order system
    Plambeck, E. L.; Ward, A. R.
  • Usage restriction and subscription services: Operational benefits with rational users
    Randhawa, R. S.; Kumar, S.
  • The queue M/G/1 with the shortest remaining processing time discipline
    Schrage, L. E.; Miller, L.
  • Maxweight scheduling in a generalized switch: State space collapse and equivalent workload minimization under complete resource pooling
    Stolyar, A. L.
  • Optimal control of distributed parallel server systems under the Halfin and Whitt regime
    Tezcan, T.
  • Dynamic scheduling with convex delay costs: The generalized c rule
    Van Mieghem, J. A.
  • Approximations for the GI/G/m queue
    Whitt, W.
  • How multiserver queues scale with growing congestion-dependent demand
    Whitt, W.
  • Scheduling for today's computer systems: Bridging theory and practice
    Wierman, A.