Optimal Leadtime Differentiation via Diffusion Approximations

Erica L. Plambeck ()
Additional contact information
Erica L. Plambeck: Graduate School of Business, Stanford University, Stanford, California 94305

Operations Research, 2004, vol. 52, issue 2, 213-228

Abstract: This study illustrates how a manufacturer can use leadtime differentiation--selling the same product to different customers at different prices based on delivery leadtime--to simultaneously increase revenue and reduce capacity requirements. The manufacturer’s production facility is modeled as an exponential single-server queue with two classes of customers that differ in price sensitivity and delay sensitivity. The manufacturer chooses the service rate and a static price for each class of customer, and then dynamically quotes leadtimes to potential customers and decides the order in which customers are processed. The arrival rate for each class decreases linearly with price and leadtime. The manufacturer’s objective is to maximize profit, subject to the constraint that each customer must be processed within the promised leadtime. Assuming that some customers will tolerate a long delivery leadtime, we show that this problem has a simple near-optimal solution. Under our proposed policy, capacity utilization is near 100%. Impatient customers pay a premium for immediate delivery and receive priority in scheduling, whereas patient customers are quoted a leadtime proportional to the current queue length. Queue length and leadtime can be closely approximated by a reflected Ornstein-Uhlenbeck diffusion process. Hence, we have a closed form expression for profit, and choose prices and capacity to optimize this. In case customers may choose either the class 1 deal or the class 2 deal, the proposed policy is made incentive compatible by quoting a leadtime for the class 2 (patient) customers that is longer than the actual queueing delay.

Keywords: pricing; capacity; dynamic leadtime quotation and sequencing in production/scheduling; diffusion approximations for priority queues (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (24)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1030.0089 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:52:y:2004:i:2:p:213-228

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().