A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Approximation Algorithms for the Joint Replenishment Problem with Deadlines
[chapter]
2013
Lecture Notes in Computer Science
The Joint Replenishment Problem (JRP) is a fundamental optimization problem in supply-chain management, concerned with optimizing the flow of goods over time from a supplier to retailers. Over time, in response to demands at the retailers, the supplier sends shipments, via a warehouse, to the retailers. The objective is to schedule shipments to minimize the sum of shipping costs and retailers' waiting costs. We study the approximability of JRP with deadlines, where instead of waiting costs the
doi:10.1007/978-3-642-39206-1_12
fatcat:ojwlvgkuh5h2nky6kj5r6ltntq