Inventory and Facility Location Models with Market Selection

We consider important generalizations of a wide class of traditional deterministic inventory and facility location models that we call inventory/facility location models with market selection. Instead of the traditional setting, we are given a set of markets, each specified by a sequence of demands and associated with a revenue. Decisions are made in two stages. We first make a decision of what markets to select, where all other markets are rejected. Next we have to construct a minimum-cost production plan (facility layout) to satisfy all of the demands of all the selected markets. The goal is to minimize the overall lost revenues of rejected markets and the production (facility openings and connection) costs. We show how to leverage existing approximation results for the traditional models to corresponding results for the counterpart models with market selection. More specifically, any LP based α–approximation for the traditional model can be leveraged to a $\frac{1}{_{1-e}-\frac{1}{\alpha}}$- approximation algorithm for the counterpart model with market selection. Our techniques are also applicable to an important class of covering problems.

[1]  Mohammad Mahdian,et al.  Improved Approximation Algorithms for Metric Facility Location Problems , 2002, APPROX.

[2]  E. Arkin,et al.  Computational complexity of uncapacitated multi-echelon production planning problems , 1989 .

[3]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

[4]  Dimitris Bertsimas,et al.  On Dependent Randomized Rounding Algorithms , 1996, IPCO.

[5]  Harvey M. Wagner,et al.  Dynamic Version of the Economic Lot Size Model , 2004, Manag. Sci..

[6]  David B. Shmoys,et al.  Primal-dual algorithms for deterministic inventory problems , 2004, STOC '04.

[7]  Mohammad Mahdian,et al.  A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem , 2003, RANDOM-APPROX.

[8]  Laurence A. Wolsey,et al.  Lot-Sizing with Constant Batches: Formulation and Valid Inequalities , 1993, Math. Oper. Res..

[9]  David B. Shmoys,et al.  A constant approximation algorithm for the one-warehouse multi-retailer problem , 2005, SODA '05.

[10]  Joseph Geunes,et al.  Requirements Planning with Pricing and Order Selection Flexibility , 2006, Oper. Res..

[11]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[12]  J. Krarup,et al.  Plant location, Set Covering and Economic Lot Size: An 0 (mn)-Algorithm for Structured Problems , 1977 .

[13]  Rekha R. Thomas,et al.  Trends in Optimization , 2004 .

[14]  Samir Khuller,et al.  Algorithms for facility location problems with outliers , 2001, SODA '01.

[15]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[16]  Chaitanya Swamy,et al.  Stochastic optimization is (almost) as easy as deterministic optimization , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[17]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[18]  Chaitanya Swamy,et al.  Facility location with Service Installation Costs , 2004, SODA '04.

[19]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.

[20]  Laurence A. Wolsey,et al.  Uncapacitated lot-sizing: The convex hull of solutions , 1984 .