Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs
- 1 June 2009
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 57 (3), 753-768
- https://doi.org/10.1287/opre.1080.0608
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
This publication has 44 references indexed in Scilit:
- Pricing and scheduling decisions with leadtime flexibilityEuropean Journal of Operational Research, 2006
- Demand and Production Management with Uniform Guaranteed Lead TimeProduction and Operations Management, 2005
- Heavy traffic analysis of open processing networks with complete resource pooling: Asymptotic optimality of discrete review policiesThe Annals of Applied Probability, 2005
- Order selection and scheduling with leadtime flexibilityIIE Transactions, 2004
- DELIVERY GUARANTEES AND THE INTERDEPENDENCE OF MARKETING AND OPERATIONSProduction and Operations Management, 2002
- Consumer Perception and Evaluation of Waiting Time: A Field ExperimentJournal of Consumer Psychology, 2002
- Quoting manufacturing due dates subject to a service level constraintIIE Transactions, 2000
- Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimalityThe Annals of Applied Probability, 2000
- V- and GG-shaped properties for optimal single machine schedules for a class of non-separable penalty functionsEuropean Journal of Operational Research, 1995
- Experimental Tests of the Endowment Effect and the Coase TheoremJournal of Political Economy, 1990