Final published version
Licence: CC BY: Creative Commons Attribution 4.0 International License
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - The periodic review model with independent age‐dependent lifetimes
AU - Clarkson, Jake
AU - Voelkel, Michael A.
AU - Sachs, Anna‐Lena
AU - Thonemann, Ulrich W.
PY - 2023/3/31
Y1 - 2023/3/31
N2 - A retailer places orders periodically for items that are shipped by a wholesaler. Items that are not sold perish randomly and independently of one another, with the perish probability depending on the age class. We consider a first‐in‐first‐out policy for depleting items. We model this problem as a Markov decision process with stochastic demand, unit holding, outdating and ordering costs, plus unit penalty costs for lost sales. We prove convexity for the penultimate period and show convexity may not hold any earlier. A dynamic program can be solved optimally for small instances. We introduce both a one‐stage‐lookahead heuristic and a heuristic which is a combination of two existing standard approaches, the newsvendor and periodic review models. For simulated data, we compare these heuristics to the optimal solution for small problem instances and to further lookahead policies for larger problem instances. We show that the two new heuristics achieve results close to optimal. Our numerical study, which includes real data from a large European retail chain, highlights that products perishing independently from each other strongly affect model behavior compared to existing approaches from the literature.
AB - A retailer places orders periodically for items that are shipped by a wholesaler. Items that are not sold perish randomly and independently of one another, with the perish probability depending on the age class. We consider a first‐in‐first‐out policy for depleting items. We model this problem as a Markov decision process with stochastic demand, unit holding, outdating and ordering costs, plus unit penalty costs for lost sales. We prove convexity for the penultimate period and show convexity may not hold any earlier. A dynamic program can be solved optimally for small instances. We introduce both a one‐stage‐lookahead heuristic and a heuristic which is a combination of two existing standard approaches, the newsvendor and periodic review models. For simulated data, we compare these heuristics to the optimal solution for small problem instances and to further lookahead policies for larger problem instances. We show that the two new heuristics achieve results close to optimal. Our numerical study, which includes real data from a large European retail chain, highlights that products perishing independently from each other strongly affect model behavior compared to existing approaches from the literature.
KW - age-dependent lifetime
KW - inventory management
KW - perishables
KW - random lifetime
U2 - 10.1111/poms.13900
DO - 10.1111/poms.13900
M3 - Journal article
VL - 32
SP - 813
EP - 828
JO - Production and Operations Management
JF - Production and Operations Management
SN - 1059-1478
IS - 3
ER -