Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Dewan, H. Mendelson (1990)
User delay costs and internal pricing for a service facilityManagement Science, 36
H. Mendelson (1985)
Pricing computer services: queueing effectsCommun. ACM, 28
R. Weber (1983)
Technical Note - A Note on Waiting Times in Single Server QueuesOper. Res., 31
C. Bell, S. Stidham (1983)
Individual versus Social Optimization in the Allocation of Customers to Alternative ServersManagement Science, 29
B. Miller, A. Buckman (1987)
Cost Allocation and Opportunity CostsManagement Science, 33
S. Lippman, S. Stidham (1977)
Individual versus Social Optimization in Exponential Congestion SystemsOper. Res., 25
D. Topkis (1978)
Minimizing a Submodular Function on a LatticeOper. Res., 26
S. Lippman (1975)
Applying a New Device in the Optimization of Exponential Queuing SystemsOper. Res., 23
Jr. Stidham (1985)
Optimal control of admission to a queueing systemIEEE Transactions on Automatic Control, 30
H. Mendelson, S. Whang (1990)
Optimal Incentive-Compatible Priority Pricing for the M/M/1 QueueOper. Res., 38
We consider a model for optimal pricing and capacity for a service facility. The problem is formulated as one of optimal design of a single-server queueing system, in which the design variables are the service rate and the arrival rate (equivalently, the price charged for admission). The model is a variant of one introduced by Dewan and Mendelson. We allow for an upper bound on the arrival rate and consider slightly more general user value functions. We show that an optimal solution may not lie in the interior of the feasible region and thus may not be characterized by the first-order differential conditions. Moreover, the first-order conditions typically have several solutions, some of which may be relative minima and produce a negative value of the objective function (customer value minus the sum of expected delay cost and capacity cost per unit time). We also examine the stability of the equilibrium arrival rate and the convergence of a dynamic adaptive algorithm for finding the optimal service rate, in the context of a model in which the distribution of customers' value of service is uniform. We show that the equilibrium arrival rate is stable if and only if the service rate is above a threshold value, which depends on the price charged for admission and the parameters of the uniform distribution of value of service. The dynamic, adaptive algorithm always converges to a relative maximum of the objective function if the service rate can be adjusted every time the arrival rate changes. Otherwise, the algorithm will start to diverge if and when the service rate ever falls below the threshold value associated with stability of the equilibrium arrival rate.
Management Science – INFORMS
Published: Aug 1, 1992
Keywords: Keywords : optimal pricing ; optimal capacity ; service facility ; optimal design of queues ; stable equilibrium
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.