What people are saying - Write a review
We haven't found any reviews in the usual places.
Formulations Bounds and Complexity
The Joint Replenishment Problem
3 other sections not shown
approximation algorithms assembly system average cost becomes a candidate branch and bound candidate items cluster Cj cluster network computational consider constant demand cost covering heuristic denote dual problem dynamic lot sizing dynamic programming external demand full truck policy go to step heuristic policy holding cost rate incurred by item inventory holding cost item trucking problem joint cost joint replenishment problem Joneja Lagrangian relaxation last order Lemma linear programming lot sizing problem lower bound LP relaxation multi-echelon multi-item trucking problem nested policies nestedness non-stationary demand NP-complete obtained optimal cost optimal policy optimal solution order is placed order quantity ordering policy OWNR path from node place an order problem JRP production-distribution system pull order regular order relative cost reorder interval retailer Roundy setup cost single item problem single item trucking solved subinterval subproblem Theorem total cost total ordering truck capacity truck cost variant worst case performance worst case relative