Improved lower bounds for the capacitated lot sizing problem with setup times

被引：44

作者：

Jans, R

Degraeve, Z

机构：

[1] Erasmus Univ, Rotterdam Sch Management, NL-3000 DR Rotterdam, Netherlands

[2] London Business Sch, London NW1 4SA, England

来源：

OPERATIONS RESEARCH LETTERS | 2004年 / 32卷 / 02期

关键词：

capacitated lot sizing; Dantzig-Wolfe decomposition; Lagrange relaxation; lower bounds;

D O I：

10.1016/j.orl.2003.06.001

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We present new lower bounds for the capacitated lot sizing problem, applying decomposition to the network reformulation. The demand constraints are the linking constraints and the problem decomposes into subproblems per period containing the capacity and setup constraints. Computational results and a comparison to other lower bounds are presented. (C) 2003 Elsevier B.V. All rights reserved.

引用

页码：185 / 195

页数：11

共 17 条

[1]

BARANY I, 1984, MATH PROGRAM STUD, V22, P32, DOI 10.1007/BFb0121006

[2] bc-prod:: A specialized branch-and-cut system for lot-sizing problems [J].