Can I read Approximation Algorithms for General One-warehouse Multi-retailer Systems on EtoBox?

Approximation Algorithms for General One-warehouse Multi-retailer Systems by Zuo-Jun Max Shen; Jia Shu; David Simchi-Levi; Chung-Piaw Teo; Jiawei Zhang is a Engineering article available to read on EtoBox.

What is Approximation Algorithms for General One-warehouse Multi-retailer Systems about?

## Abstract Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor

Who reads Approximation Algorithms for General One-warehouse Multi-retailer Systems?

Author

Zuo-Jun Max Shen; Jia Shu; David Simchi-Levi; Chung-Piaw Teo; Jiawei Zhang

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0894-069X)

Published

2009

Language

EN

Field

Engineering (Physical Sciences)