bc-prod:: A specialized branch-and-cut system for lot-sizing problems

被引:124
作者
Belvaux, G [1 ]
Wolsey, LA [1 ]
机构
[1] CORE, B-1348 Louvain, Belgium
关键词
manufacturing; lot-sizing; branch-and-cut; modelling language;
D O I
10.1287/mnsc.46.5.724.12048
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
bc - prod is a prototype modelling and optimization system designed and able to tackle a wide variety of the discrete-time lot-sizing problems arising both in practice and in the literature. To use be - prod, the user needs to formulate his/her problem as a mixed integer program using XPRESS-MP's mp - model, a standard mathematical programming modelling language, taking into account a reserved set of key words for specific lot-sizing objects, such as production variables, storage, and demand data, etc. The problem is then solved by the XPRESS-MP branch-and-bound system including lot-sizing specific preprocessing, cutting planes for different aspects of lot-sizing problems, plus general cutting planes, and a lot-sizing-specific primal heuristic. Results are presented for a wide variety of big bucket and small bucket models with set-up and start-up costs and times.
引用
收藏
页码:724 / 738
页数:15
相关论文
共 27 条
[1]   OPTIMAL LOT-SIZING ALGORITHMS FOR COMPLEX PRODUCT STRUCTURES [J].
AFENTAKIS, P ;
GAVISH, B .
OPERATIONS RESEARCH, 1986, 34 (02) :237-249
[2]  
BELVAUX G, 1998, LOTSIZELIB LIB LOT S
[3]  
BELVAUX G, 1998, DP9849 CORE U CATH L
[4]  
BELVAUX G, 1999, THESIS U CATHOLIQUE
[5]  
BIXBY RE, 1996, UPDATE MIXED INTEGER
[6]  
*CHES DEC SCI INC, 1989, CHES PROBL
[7]   A cutting plane approach to capacitated lot-sizing with start-up costs [J].
Constantino, M .
MATHEMATICAL PROGRAMMING, 1996, 75 (03) :353-376
[8]  
CONSTANTINO M, 1995, THESIS U CATHOLIQUE
[9]   bc-opt:: a branch-and-cut code for mixed integer programs [J].
Cordier, C ;
Marchand, H ;
Laundy, R ;
Wolsey, LA .
MATHEMATICAL PROGRAMMING, 1999, 86 (02) :335-353
[10]  
*DASH ASS, 1997, XPRESS MP EXT MOD OP