Fix-and-optimize and variable neighborhood search approaches for multi-level capacitated lot sizing problems
Author:
- Haoxun ChenHCHaoxun Chen
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problemsElectronic Notes in Discrete Mathematics, 2012
- A computational analysis of lower bounds for big bucket production planning problemsComputational Optimization and Applications, 2012
- A MIP-based framework and its application on a lot sizing problem with setup carryoverJournal of Heuristics, 2011
- A fix-and-optimize approach for the multi-level capacitated lot sizing problemInternational Journal of Production Economics, 2010
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristicComputers & Operations Research, 2009
- Dynamic capacitated lot-sizing problems: a classification and review of solution approachesOR Spectrum, 2008
- Meta-heuristics for dynamic lot sizing: A review and comparison of solution approachesEuropean Journal of Operational Research, 2007
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup TimesManagement Science, 1996
- Capacitated Lot Sizing with Setup TimesManagement Science, 1989
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem ReductionManagement Science, 1983