The Capacitated Lot-Sizing Problem with Linked Lot Sizes
为带批量链接的产能批量问题提出新的混合整数规划模型，并嵌入时间导向分解启发式算法，通过有效不等式收紧模型，计算测试表明解质量优于已有算法。
In this paper a new mixed integer programming (MIP) model formulation and its incorporation into a time-oriented decomposition heuristic for the capacitated lot-sizing problem with linked lot sizes (CLSPL) is proposed. The solution approach is based on an extended model formulation and valid inequalities to yield a tight formulation. Extensive computational tests prove the capability of this approach and show a superior solution quality with respect to other solution algorithms published so far.