Deterministic lotsizing models for production planning (Q1202117)

In this dissertation, the author investigates deterministic lotsizing problems, and provides an extensive overview of the existing simple mathematical models. He then introduces some new model formulations and solution procedures for more general situations in which capacity restrictions, setup times and sequencing aspects are considered explicitly. The most original material includes computational complexity results, and the use of Lagrangean relaxation, Dynamic Programming, Valid Inequalities, Simulated Annealing, and Tabu search for solution procedures.