Solving multi-level capacitated lot sizing problems via a fix-and-optimize approach
From MaRDI portal
Recommendations
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
Cites work
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Deterministic Production Planning: Algorithms and Complexity
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- The capacitated lot-sizing problem with linked lot sizes
Cited in
(14)- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- Primal-dual approach to the single level capacitated lot-sizing problem
- An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels
- Valid inequalities, preprocessing, and an effective heuristic for the uncapacitated three-level lot-sizing and replenishment problem with a distribution structure
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Multi-objective Pareto adaptive algorithm for capacitated lot-sizing problems in glass lens production
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- Combining population-based and exact methods for multi-level capacitated lot-sizing problems
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- scientific article; zbMATH DE number 5583359 (Why is no real title available?)
- Incorporating a database approach into the large-scale multi-level lot sizing problem
- Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
This page was built for publication: Solving multi-level capacitated lot sizing problems via a fix-and-optimize approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232871)