384. Least Unit Cost

A lot-sizing heuristic similar to Silver-Meal, but minimizing cost per unit produced instead of cost per period covered.

384.1. Algorithm

For an order starting in period 𝑡 covering 𝑘 periods:

𝐶LUC(𝑘)=𝐾+𝑗=1𝑘1𝑗𝑑𝑡+𝑗𝑗=0𝑘1𝑑𝑡+𝑗

Numerator: total setup + holding cost. Denominator: total units in the order.

Extend 𝑘 while 𝐶LUC(𝑘) decreases. Stop when it increases. Order covers 𝑘 periods.

384.2. Compared to Silver-Meal

When demand is uniform, the two give similar / identical answers. When demand varies, they diverge:

Neither is strictly better. Both are heuristics, both within  5% of Wagner-Whitin optimum on typical instances.

384.3. Worked example

Same data as Silver-Meal: 𝑑=(60,100,80,50,40,70), 𝐾=100, =1.

Start period 1:

(Same answer as Silver-Meal in this case.)

384.4. When LUC favors larger orders

If subsequent demand is high (say 𝑑𝑡+1=1000), Silver-Meal’s per-period cost increases fast (high holding cost on big inventory), but LUC’s per-unit cost may still drop (fixed cost spread over more units).

So LUC tends to bundle into larger orders when downstream demand is high.

384.5. See also