Near Myopic Heuristics for the Fixed-Life Perishability Problem
针对固定寿命易腐品问题，提出基于近近视边界的启发式方法，利用报童模型推导紧边界，计算简单且接近最优，对库存管理者有实用价值。
This paper details the application of a class of heuristics to the Fixed-life Perishability Problem formulated by Nahmias (1975a) and Fries (1975). Various assumptions for this model include i.i.d. demand, linear ordering, holding and penalty costs. Goods have a known fixed lifetime and perished goods cause a linear outdating cost to be incurred. The approach we use, that of developing heuristics from ‘near myopic’ bounds, involves viewing periodic inventory problems in the framework of the classic “newsboy” model. We exploit various properties of the problem under consideration to derive tight bounds on the newsboy parameters, thus leading to efficient bounds on the order quantities. Computational studies reveal that the heuristic policies are near optimal, and are easy to compute.