This paper presents a new algorithm for the dynamic Multi-Level Ca-pacitated Lot Sizing Problem with Setup Carry-Overs (MLCLSP-L). TheMLCLSP-L is a big-bucket model that allows the production of any num-ber of products within a period, but it incorporates partial sequencing of theproduction...

This paper presents an optimization-based solution approach for the dynamicmulti-level capacitated lot sizing problem (MLCLSP) with positive leadtimes. The key idea is to solve a series of mixed-integer programs in an iterativefix-and-optimize algorithm. Each of these programs is optimized over...

This paper presents a linear programming approach to analyze and optimizeow lines with limited buer capacities and stochastic processing times. The basic ideais to solve a huge but simple linear program that models an entire simulation run of amulti-stage production process in discrete time, to...

In stochastic lot sizing subject to dynamic and random demand, the minimization of operational costs is not the only conceivable objective. Minimizing the tardiness in customer demand satisfaction is no less important. Furthermore, the decision maker is interested in production plan stability....