首页 | 本学科首页   官方微博 | 高级检索  
     


Improved lower bounds for the capacitated lot sizing problem with setup times
Authors:Raf Jans  Zeger Degraeve
Affiliation:a Rotterdam School of Management, Erasmus University, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands
b London Business School, Regent's Park, London NW1 4SA, UK
Abstract: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.
Keywords:Capacitated lot sizing   Dantzig-Wolfe decomposition   Lagrange relaxation   Lower bounds
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号