fixed charge networks – Optimization Online

Formulations for Dynamic Lot Sizing with Service Levels

Published: 2010/12/09, Updated: 2012/05/08

(Mixed) Integer Linear Programming, Applications - OR and Management Sciences, Combinatorial Optimization extended formulation, fixed charge networks, lot sizing, service levels, shortest paths

In this paper, we study deterministic dynamic lot-sizing problems with service level constraints on the total number of periods in which backorders can occur over the finite planning horizon. We give a natural mixed integer programming formulation for the single item problem (LS-SL-I) and study the structure of its solution. We show that an optimal … Read more

Lot sizing with inventory gains

Published: 2006/04/27, Updated: 2006/11/22

Hamish Waterer

(Mixed) Integer Linear Programming, Network Optimization, Production and Logistics deteriorating inventory, fixed charge networks, generalized networks, inventory gains, lot sizing, networks with gains, perishable inventory, production planning

This paper introduces the single item lot sizing problem with inventory gains. This problem is a generalization of the classical single item capacitated lot sizing problem to one in which stock is not conserved. That is, the stock in inventory undergoes a transformation in each period that is independent of the period in which the … Read more