Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs

Barış Ata () and Tava Lennon Olsen ()
Additional contact information
Barış Ata: Kellogg School of Management, Northwestern University, Evanston, Illinois 60208
Tava Lennon Olsen: Washington University in St. Louis, St. Louis, Missouri 63130

Operations Research, 2009, vol. 57, issue 3, 753-768

Abstract: We consider a make-to-order system where customers are dynamically quoted lead times (and prices). Customers are homogenous but have general (nonlinear) disutility for delay. Because the firm is a monopolist, the pricing problem is trivial and the dynamic problem reduces to one of lead-time quotation and order sequencing. We also consider the (static) problem of up-front capacity installation. We use a large-capacity asymptotic regime to make the problem tractable. We provide recommended policies for convex, concave, and convex-concave lead-time cost functions and prove that these policies are asymptotically optimal. The policies are both highly intuitive and readily implementable. Moreover, they provide delay guarantees for all served customers. They are tested numerically; we find that significant benefits can accrue by using the prescribed dynamic policies instead of first-come-first-served type policies.

Keywords: production/scheduling; dynamic lead-time quotation; queues; limit theorems (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1080.0608 (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:57:y:2009:i:3:p:753-768

Access Statistics for this article

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