A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
提出基于拉格朗日松弛的启发式方法，求解含准备时间和有限加班的超大规模有产能批量问题，能在合理时间内得到接近最优的解。
In this paper, we develop a Lagrangean relaxation-based heuristic procedure to generate near-optimal solutions to very-large-scale capacitated lot-sizing problems (CLSP) with setup times and limited overtime. Our computational results show that large problems involving several thousand products and several thousand 0/1 integer variables can be solved in a reasonable amount of computer time to within one percent of their optimal solution. The proposed procedure is general enough to be applied directly or with slight modification to real-life production problems.