Setting planned leadtimes in serial production systems with tardiness costs
Management Science
Due-date setting and priority sequencing in a multiclass M/G.1 queue
Management Science
The role of inventory in delivery-time competition
Management Science
Single facility due date setting with multiple customer classes
Management Science
Management Science
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Product Differentiation and Capacity Cost Interaction in Time and Price Sensitive Markets
Manufacturing & Service Operations Management
Optimal Leadtime Differentiation via Diffusion Approximations
Operations Research
Pricing and Lead Time Decisions in Decentralized Supply Chains
Management Science
Promised Lead-Time Contracts Under Asymmetric Information
Operations Research
Expected Tardiness Computations in Multiclass Priority M/M/c Queues
INFORMS Journal on Computing
Pricing Time-Sensitive Services Based on Realized Performance
Manufacturing & Service Operations Management
Hi-index | 0.00 |
For a dynamic joint price and lead-time quotation problem with a fairly general demand function, we show that the policy consisting of a threshold and a reward-maximizing lead-time is optimal. This policy offers some interesting managerial insights. Under this policy, finding the exact optimal quotation can be accomplished by single-variable policy iterations of unimodal value functions.