Integrated Supply Chain Management via Randomized Rounding
We consider the supply chain problem of minimizing ordering, distribution and inventory holding costs of a supply chain formed by a set of warehouses and retailers over a finite time horizon, that we call Production and Distribution Problem (PDP). This is a common generalization of the classical Metric Facility Location Problem and Joint Replenishment Problem, that coordinates the network design and inventory management decisions in an integrated manner. This coordination can represent significant economy for many applications, where network design and operational costs are normally considered separately. This problem is considered when the instances satisfy assumptions such as metric space of warehouse and retailer locations, and monotonic increasing inventory holding costs. In this work, we give a 2.77-approximation based on the randomized rounding of the natural mixed integer programming relaxation. Also, we give a 5-approximation for the case that objective function includes retailer ordering costs.
KeywordsCluster Center Mixed Integer Programming Service Cost Facility Location Problem Demand Point
Unable to display preview. Download preview PDF.
- 8.Li, Y., Shu, J., Wang, X., Xiu, N., Xu, D., Zhang, J.: Approximation Algorithms for Integrated Distribution Network Design Problems. In: INFORMS J. Comp. (2012)Google Scholar
- 9.Lin, J.-H., Vitter, J.S.: ε-approximations with minimum packing constraint violation (extended abstract). In: Proc. of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 771–782 (1992)Google Scholar