A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
提出一种启发式方法，解决具有多资源约束和准备时间的多级多物品批量调度问题，通过拉格朗日松弛分解为单物品问题，并计算上下界，适用于生产计划优化。
In this paper a heuristic approach for the dynamic multilevel multiitem lotsizing problem in general product structures with multiple constrained resources and setup times is proposed. With the help of Lagrangean relaxation the capacitated multilevel multiitem lotsizing problem is decomposed into several uncapacitated single-item lotsizing problems. From the solutions of these single-item problems lower bounds on the minimum objective function value are derived. Upper bounds are generated by means of a heuristic finite scheduling procedure. The quality of the approach is tested with reference to various problem groups of differing sizes.