Premium
Simple Policies with Provable Bounds for Managing Perishable Inventory
Author(s) -
Zhang Hailun,
Zhang Jiheng,
Zhang Rachel Q.
Publication year - 2020
Publication title -
production and operations management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.279
H-Index - 110
eISSN - 1937-5956
pISSN - 1059-1478
DOI - 10.1111/poms.13244
Subject(s) - perishability , computer science , curse of dimensionality , heuristic , intuition , simple (philosophy) , inventory management , mathematical optimization , operations research , microeconomics , economics , operations management , business , mathematics , marketing , artificial intelligence , philosophy , epistemology
The two fundamental decisions in the management of perishable inventory are how much new inventory to order and how much old inventory to clear before expiration. These decisions are known to be difficult due to the curse of dimensionality. We propose policies that are much simpler and easier to implement than existing ones in the literature. Our analysis revealed interesting insights into the circumstances under which perishability is negligible. This intuition not only leads to the construction of our simple policies, but also helps to establish theoretical performance bounds on the proposed policies. The bounds vanish asymptotically as the market size becomes large and clearly specify a required size for our policies to achieve any given optimality gap. Numerical studies suggest that our policies can work well even for small‐to‐medium‐sized systems and achieve comparable performance to existing heuristic polices.