Heuristic policies for
time-varying deterministic processes with
infinite input rate have been thoroughly explored in the
literature. This paper addresses heuristic decision rules for the situation of a deterministic linearly increasing and decreasing demand patterns with a finite input rate. We determine the timing and sizing of replenishment so as to keep the total relevant cost as low as possible. We extended the Silver-Meal heuristic method and found the penalty cost is very low.