Moerman, B.

algorithm envelope period segment line segment technique recursion production line segments programming set-up problem point slope van hoesel set-up costs theorem hoesel model section production period result horizon lot-sizing planning period t lot-sizing problem value 2-3 tree operation breakpoint right planning horizon theorem programming algorithm step 2 b motive inventory production costs iteration solution interval figure program stack number order effect instance property condition structure variable proof 2-3 paper wagelman complexity programming variables example table schedule data structure erasmus university rotterdam demand t h e backlogging suffice whitin line m i planning horizon 1 formula research planning horizon t wagner algorithm ww 1 planning horizon envelope gi intersection point recursion formulas 1.5