Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 54, No. 5, September-October 2006, pp. 914-932
DOI: 10.1287/opre.1060.0305
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Maglaras, C.
Right arrow Search for Related Content

Revenue Management for a Multiclass Single-Server Queue via a Fluid Model Analysis

Constantinos Maglaras

Columbia Business School, Columbia University, 409 Uris Hall, 3022 Broadway, New York, New York 10027
c.maglaras{at}gsb.columbia.edu

Motivated by the recent adoption of tactical pricing strategies in manufacturing settings, this paper studies a problem of dynamic pricing for a multiproduct make-to-order system. Specifically, for a multiclass Mn/M/1 queue with controllable arrival rates, general demand curves, and linear holding costs, we study the problem of maximizing the expected revenues minus holding costs by selecting a pair of dynamic pricing and sequencing policies. Using a deterministic and continuous (fluid model) relaxation of this problem, which can be justified asymptotically as the capacity and the potential demand grow large, we show the following: (i) greedy sequencing (i.e., the cµ-rule) is optimal, (ii) the optimal pricing and sequencing decisions decouple in finite time, after which (iii) the system evolution and thus the optimal prices depend only on the total workload. Building on (i)–(iii), we propose a one-dimensional workload relaxation to the fluid pricing problem that is simpler to analyze, and leads to intuitive and implementable pricing heuristics. Numerical results illustrate the near-optimal performance of the fluid heuristics and the benefits from dynamic pricing.

Subject classifications: revenue management; yield management; dynamic pricing; queuing; sequencing; fluid models.
History: Received November 2003; revision received August 2005; accepted September 2005.




This article has been cited by other articles:


Home page
Management ScienceHome page
S. Celik and C. Maglaras
Dynamic Pricing and Lead-Time Quotation for a Multiclass Make-to-Order Queue
Management Science, June 1, 2008; 54(6): 1132 - 1146.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2006 by INFORMS.