Joint replenishment policy for inventory system with demand substitution

Author(s):  
Xiaohong Zhang ◽  
Jian Chen
2018 ◽  
Vol 20 (3) ◽  
pp. 1665-1684 ◽  
Author(s):  
Young Hyeon Yang ◽  
Jong Soo Kim

2013 ◽  
Vol 46 (7) ◽  
pp. 1172-1198 ◽  
Author(s):  
Ata Allah Taleizadeh ◽  
Hadi Samimi ◽  
Babak Mohammadi

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Wen-Tsung Ho

This work investigates the joint replenishment problem (JRP) involving multiple items where economies exist for replenishing several items simultaneously. The demand rate for each item is known and constant. Shortages are not permitted and lead times are negligible. Many heuristic algorithms have been proposed to find quality solutions for the JRP. In this paper, cycle time division and recursive tightening methods are developed to calculate an efficient and optimal replenishment policy for JRP. Two theorems are demonstrated to guarantee that an optimal solution to the problem can be derived using cycle time division and recursive tightening methods. Restated, cycle time division and recursive tightening methods theoretically yield the optimal solution in 100% of instances. The complexity of cycle time division and recursive tightening methods is justO(NlogN), whereNrepresents the number of items involved in the problem. Numerical examples are included to demonstrate the algorithmic procedures.


2011 ◽  
Vol 2011 ◽  
pp. 1-15 ◽  
Author(s):  
G. Darzanou ◽  
K. Skouri

An inventory system for deteriorating products, with ramp-type demand rate, under two-level trade credit policy is considered. Shortages are allowed and partially backlogged. Sufficient conditions of the existence and uniqueness of the optimal replenishment policy are provided, and an algorithm, for its determination, is proposed. Numerical examples highlight the obtained results, and sensitivity analysis of the optimal solution with respect to major parameters of the system is carried out.


Sign in / Sign up

Export Citation Format

Share Document