Optimal incentive-compatible priority pricing for the M/M/1 queue
Operations Research
Single facility due date setting with multiple customer classes
Management Science
Management Science
Queueing Systems: Theory and Applications
Optimal Pricing of Priority Services
Operations Research
Dimensioning Large Call Centers
Operations Research
Optimal Leadtime Differentiation via Diffusion Approximations
Operations Research
Reliable Due-Date Setting in a Capacitated MTO System with Two Customer Classes
Operations Research
Queueing Systems: Theory and Applications
Dynamic Pricing and Lead-Time Quotation for a Multiclass Make-to-Order Queue
Management Science
Scheduling Flexible Servers with Convex Delay Costs in Many-Server Service Systems
Manufacturing & Service Operations Management
Exploiting Market Size in Service Systems
Manufacturing & Service Operations Management
Incentive-Compatible Revenue Management in Queueing Systems: Optimal Strategic Delay
Manufacturing & Service Operations Management
Hi-index | 0.00 |
This paper studies a queuing model where two customer classes compete for a given resource and each customer is dynamically quoted a menu of price and leadtime pairs upon arrival. Customers select their preferred pairs from the menu and the server is obligated to meet the quoted leadtime. Customers have convex---concave delay costs. The firm does not have information on a given customer's type, so the offered menus must be incentive compatible. A menu quotation policy is given and proven to be asymptotically optimal under traditional large-capacity heavy-traffic scaling.