Access to this article is restricted until 24 months after publication by request of the publisher. Restriction lift date: 2027-01-07
A heuristic method for perishable inventory management under non-stationary demand
Loading...
Files
Date
2025-01-07
Authors
Gulecyuz, Suheyl
O’Sullivan, Barry
Tarim, S. Armagan
Journal Title
Journal ISSN
Volume Title
Publisher
Elsevier Ltd.
Published Version
Abstract
Our study considers a perishable inventory system under a finite planning horizon, periodic review, non-stationary stochastic demand, zero lead time, FIFO (first in, first out) issuing policy, and a fixed shelf life. The inventory system has a fixed setup cost and linear ordering, holding, penalty, and outdating costs per item. We introduce a computationally-efficient heuristic which formulates the problem as a network graph, and then calculates the shortest path in a recursive way and by keeping the average total cost per period at minimum. The heuristic firstly determines the replenishment periods and cycles using the deterministic-equivalent shortest path approach. Taking the replenishment plan constructed in the first step as an input, it calculates the order quantities with respect to the observed inventory states as a second step. We conduct numerical experiments for various scenarios and parameters, and compare them to the optimal stochastic dynamic programming (SDP) results. Our experiments conclude that the computation time is reduced significantly, and the average optimality gap between the expected total cost and the optimal cost is 1.87%.
Description
Keywords
Inventory control , Lot sizing , Perishability , Finite-horizon total cost , Non-stationary stochastic demand , Replenishment cycle policy
Citation
Gulecyuz, S., O’Sullivan, B. and Tarim, S. A. (2024) 'A heuristic method for perishable inventory management under non-stationary demand', Omega, 133, 103267 (17pp). https://doi.org/10.1016/j.omega.2024.103267