Due-date setting and priority sequencing in a multiclass M/G.1 queue
Management Science
A single machine model for determination of optimal due dates and sequence
Operations Research
The role of inventory in delivery-time competition
Management Science
Single facility due date setting with multiple customer classes
Management Science
Management Science
Management Science
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
A Simple, Robust Leadtime-Quoting Policy
Manufacturing & Service Operations Management
Make to Order or Make to Stock: Model and Application
Management Science
Reliable Due-Date Setting in a Capacitated MTO System with Two Customer Classes
Operations Research
Expected Tardiness Computations in Multiclass Priority M/M/c Queues
INFORMS Journal on Computing
Competitive analysis for make-to-order scheduling with reliable lead time quotation
Journal of Combinatorial Optimization
Hi-index | 0.00 |
We study a dynamic lead-time quotation problem in a base-stock inventory system characterized by lead-time sensitive Poisson demand and exponentially distributed service times. We show that the optimal profit is unimodal in the base-stock level. We compare the base-stock system with a make-to-order (MTO) system and show that the lead-time quotes are lower in an MTO system and that increasing the base-stock level does not necessarily decrease the expected number of customers waiting. Numerical results show that when customers are less sensitive to lead-time quotes, the benefit of quoting lead times with a higher precision is significant, whereas when customers are more sensitive to lead-time quotes, the benefit of holding inventory is significant.