Improved lower bounds for the capacitated lot sizing problem with setup times-Reference-Cited by-同舟云学术

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

Published:2004-03 Issue:2 Volume:32 Page:185-195
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Jans Raf,Degraeve Zeger

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference17 articles.

1. Uncapacitated lot-sizing;Barany;Math. Programming Stud.,1984

2. BC-PROD;Belvaux;Management Sci.,2000

3. Analysis of relaxations for the multi-item capacitated lot-sizing problem;Chen;Ann. Oper. Res.,1990

4. Z. Degraeve, R. Jans, Improved lower bounds for the capacitated lot sizing problem with setup times, ERIM Report Series Research in Management ERS-2003-026-LIS, Erasmus University Rotterdam, The Netherlands, 2003, 20pp.

5. Capacitated lot-sizing and scheduling by Lagrangean relaxation;Diaby;European J. Oper. Res.,1992

Cited by 45 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An integrated approach for lot-sizing and storage assignment;Omega;2025-02

2. Improvement to an existing multi-level capacitated lot sizing problem considering setup carryover, backlogging, and emission control;Manufacturing Letters;2023-08

3. Formulations and exact solution approaches for a coupled bin-packing and lot-sizing problem with sequence-dependent setups;Flexible Services and Manufacturing Journal;2022-09-02

4. Predictive Search for Capacitated Multi-Item Lot Sizing Problems;INFORMS Journal on Computing;2021-08-20

5. Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover;Computers & Operations Research;2021-08