A LINEAR DESCRIPTION OF THE DISCRETE LOT-SIZING AND SCHEDULING PROBLEM

被引:19
|
作者
VANHOESEL, S [1 ]
KOLEN, A [1 ]
机构
[1] UNIV LIMBURG,6200 MD MAASTRICHT,NETHERLANDS
关键词
D O I
10.1016/0377-2217(94)90079-5
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
A new integer linear programming formulation for the discrete lot-sizing and scheduling problem is presented. This polynomial-size formulation is obtained from the model with the natural variables by splitting these variables. Its linear programming relaxation is shown to be tight, by reformulating it as a shortest path problem. The latter also provides a dynamic programming formulation for the discrete lot-sizing and scheduling problem.
引用
收藏
页码:342 / 353
页数:12
相关论文
共 50 条