We address the Joint Replenishment Problem (JRP) where, in the presence of joint setup costs, dynamic lot sizing schedules need to be determined for m items over a planning horizon of N periods, with general time-varying cost and demand parameters. We develop a new, so-called, partitioning heuristic for this problem, which partitions the complete horizon of N periods into several relatively sma...

This paper considers the joint supplier selection, replenishment and manufacturing control problem in a dynamic stochastic context. This problem is characterized by conflicting interests between suppliers, the manufacturer, and clients, which raise the need for coordination and information sharing. This paper contributes to the discourse mainly by developing and resolving an integrated mathemat...

this paper is a research on the ordering planning of a supply chain with one supplier, multi buyer and multi deteriorating items. items have fixed life time and expire dates. the ordering period is taken as variable and must be computed the proposed models. the problem is studied via two different approaches the first is the joint replenishment, based on the hwang and chew's model [3] and ...

We provide a practical methodology for solving the generalized joint replenishment (GJR) problem, based on a mathematical programming approach to approximate dynamic programming. We show how to automatically generate a value function approximation basis built upon piecewise-linear ridge functions, by developing and exploiting a theoretical connection with the problem of finding optimal cyclic s...