LTO heuristics for capacitated lot sizing problem with sequence dependent setups and overtimes

被引：0
|
作者：
Lukac, Z [1 ]
Soric, K [1 ]
Rosenzweig, VV [1 ]
机构：
[1] Fac Econ Zagreb, Zagreb 1000, Croatia
来源：
SOR 05 Proceedings | 2005年
关键词：
capacitated lot sizing problem; two machines; capacity limitations; overtimes; sequence dependent setup times; quadratic mixed 0-1 integer programming problem; heuristics; tabu search; Lagrangean relaxation;
D O I：
暂无
中图分类号：
F [经济];
学科分类号：
02 ;
摘要：
The wellknown CLSP problem is generalized including sequence dependent setup times and overtimes and modeling it as a quadratic mixed 0-1 integer programming problem called Capacitated Lot Sizing Problem with Sequence Dependent Setups and Overtimes. We develop a heuristics based on Lagrangean relaxation and tabu search for solving the problem. At the end, some computational results are presented.
引用
收藏
页码：383 / 388
页数：6
相关论文
共 50 条
12345