Combining population-based and exact methods for multi-level capacitated lot-sizing problems
DOI10.1080/00207540600620963zbMATH Open1114.90446OpenAlexW2167217969WikidataQ59389764 ScholiaQ59389764MaRDI QIDQ3430249FDOQ3430249
Authors: Rapeepan Pitakaso, Christian Almeder, K. F. Doerner, Richard F. Hartl 
Publication date: 21 March 2007
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540600620963
Recommendations
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging
- Solving multi-level capacitated lot sizing problems via a fix-and-optimize approach
- Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem
ant colony optimizationproblem decompositionmixed-integer programmulti-level lot sizingmaterial requirements planning
Cites Work
- Heuristic genetic algorithms for general capacitated lot-sizing problems
- Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing
- Title not available (Why is that?)
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A new heuristic approach for the multi-item dynamic lot sizing problem
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- A heuristic method for lot-sizing in multi-stage systems
- Improved Heuristics for Multi-Stage Requirements Planning Systems
- Randomized multi-level lot-sizing heuristics for general product structures.
- A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
- METAHEURISTIC APPROACHES FOR THE MULTILEVEL RESOURCE-CONSTRAINED LOT-SIZING PROBLEM WITH SETUP AND LEAD TIMES
Cited In (14)
- Title not available (Why is that?)
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions
- Hybrid heuristics for the multi-stage capacitated lot sizing and loading problem
- An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels
- Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over
- Predictive search for capacitated multi-item lot sizing problems
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
- A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- Lead time considerations for the multi-level capacitated lot-sizing problem
Uses Software
This page was built for publication: Combining population-based and exact methods for multi-level capacitated lot-sizing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3430249)
