On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
- 31 May 2011
- journal article
- research article
- Published by Springer Nature in Journal of Global Optimization
- Vol. 53 (4) , 615-639
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- An optimization framework for solving capacitated multi-level lot-sizing problems with backloggingEuropean Journal of Operational Research, 2011
- A novel mixed integer programming formulation and progressively stochastic search for capacitated lot sizingJournal of Systems Science and Systems Engineering, 2011
- Mathematical models for capacitated multi-level production planning problems with linked lot sizesInternational Journal of Production Research, 2011
- Particle swarm optimization for bi-level pricing problems in supply chainsJournal of Global Optimization, 2010
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristicComputers & Operations Research, 2009
- A heuristic approach for big bucket multi-level production planning problemsEuropean Journal of Operational Research, 2009
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup timesOR Spectrum, 2007
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costsRAIRO - Operations Research, 2007
- MIP-based heuristics for capacitated lotsizing problemsInternational Journal of Production Economics, 2003
- A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structuresEuropean Journal of Operational Research, 1994