Integrated Supply Chain Management via Randomized Rounding

Author(s)

Pedrosa, Lehilton L. C. ^[1] ; Sviridenko, Maxim ^[2]

Affiliation

^[1] Univ Estadual Campinas, Inst Comp, BR-13083852 Campinas, SP - Brazil

^[2] Yahoo Labs, New York, NY 10022 - USA

• Document type: Journal article
• Source: INFORMS JOURNAL ON COMPUTING; v. 30, n. 1, p. 124-136, WIN 2018.
• Web of Science Citations: 0

Abstract

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, which we call the production and distribution problem. 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 setup costs. (AU)

• FAPESP's process: 12/17634-0 - Advanced algorithms for facility location, inventory management and other supply chain optimization problems
• Grantee: Lehilton Lelis Chaves Pedrosa
• Support Opportunities: Scholarships abroad - Research Internship - Doctorate