Modelling practical lot-sizing problems as mixed-integer programs

Management Science

Volumn 47, Issue 7, 2001, Pages 993-1007

  Belvaux, Gaetan ^a   Wolsey, Laurence A ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Lot Sizing; Mixed Integer Programming; Production Planning; Reformulation; Valid Inequalities

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SOFTWARE; MANAGEMENT SCIENCE; MATHEMATICAL MODELS; PROBLEM SOLVING;

MIXED-INTEGER PROGRAMMING; PRODUCTION PLANNING;

INTEGER PROGRAMMING;

EID: 0035410522     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.47.7.993.9800     Document Type: Article

References (32)

1. Optimal lot-sizing for complex product structures
2. The prize collecting traveling salesman problem
3. Strong formulations for multi-item capacitated lot-sizing
4. BC-PROD: A specialized branch-and cut system for lot-sizing problems
5. Set partitioning and column generation heuristics for capacitated dynamic lot-sizing
6. A dual ascent and column generation heuristic for the DLSP with set-up times
7. Optimal policies for multi-echelon inventory problems
8. A cutting plane approach to capacitated lot-sizing with start-up costs
9. BCOPT: A branch-and-cut code for mixed-integer programs
10. A lagrangean relaxation approach for very large scale capacitated lot-sizing
11. A heuristic solution procedure for the multi-item, single level, limited capacity lot-sizing problem
12. Solving multi-item lot-sizing problems using variable redefinition
13. The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
14. Lot-sizing and scheduling in parallel machines with sequence-dependent setup costs
15. The deterministic dynamic product cycling problem
16. MEMIPS. Model enhanced solution methods for integer programming software
17. PAMIPS. Development of parallel algorithms and software for mixed-integer programming in industrial scheduling
18. Solving multi-item lot-sizing problems using strong cutting planes
19. Lot-sizing with constant batches: Formulation valid inequalities
20. Algorithms reformulations for lot-sizing problems
21. Adding flexibility in lot-sizing models: Minimum batch sizes cleaning times
22. Improved heuristic methods for multiple stage production planning
23. A lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times
24. Lagrangean relaxation for the multi-item capacitated lot-sizing problem
25. Lot-sizing with start-up times