Congestion-Based Lead-Time Quotation for Heterogenous Customers with Convex-Concave Delay Costs: Optimality of a Cost-Balancing Policy Based on Convex Hull Functions

نویسندگان

  • Mustafa Akan
  • Baris Ata
  • Tava Lennon Olsen
چکیده

We consider a congestible system serving multiple classes of customers who differ in their delay sensitivity and valuation of service (or product). Customers are endowed with convex-concave delay cost functions. A system manager offers a menu of lead times and corresponding prices to arriving customers, who then choose the lead-time–price pair that maximizes their net utility (value minus disutility of delay and price). We investigate how such menus should be chosen dynamically (depending on the system backlog) to maximize welfare. We formulate a novel fluid model of the problem and show that the cost-balancing policy (based on the convex hulls of the delay cost functions) is socially optimal if the system manager can tell customer types apart. If types are indistinguishable to the system manager, the cost-balancing policy is also incentive compatible under social optimization. Finally, we show through a simulation study that the cost-balancing policy does well in the context of the original (stochastic) problem by testing it against various natural benchmarks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

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 convex– concave delay costs. The firm does not have information on a given customer’s type, ...

متن کامل

One-for-One Period Policy and its Optimal Solution

In this paper we introduce the optimal solution for a simple and yet practical inventory policy with the important characteristic which eliminates the uncertainty in demand for suppliers. In this new policy which is different from the classical inventory policies, the time interval between any two consecutive orders is fixed and the quantity of each order is one. Assuming the fixed ordering cos...

متن کامل

On Sequential Optimality Conditions without Constraint Qualifications for Nonlinear Programming with Nonsmooth Convex Objective Functions

Sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. Here, nonsmooth approximate gradient projection and complementary approximate Karush-Kuhn-Tucker conditions are presented. These sequential optimality conditions are satisfied by local minimizers of optimization problems independently of the fulfillment of constrai...

متن کامل

An Inventory Model for Obsolescence Items with Consideration of Permissible Delay in Payments (Case Study of Obsolete Medicines in Pharmacies)

Background and Objectives: In the real world, the obsolescence items are some items that lose their value over time due to the emergence of new technology. Because of rapid changes in technology, inventory management of such items is considered in recent years. Moreover, suppliers try to encourage the retailers for purchasing an item before it is outmoded with some policies suc...

متن کامل

Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions

In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Operations Research

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2012