Congestion-based leadtime quotation and pricing for revenue maximization with heterogeneous customers
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 convexconcave delay costs. The firm does not have information on a given customers 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.
leadtime quotation asymptotic optimality dynamic scheduling dynamic pricing 60k30 60k25