New construction heuristic for capacitated lot sizing problems
From MaRDI portal
Publication:6096617
DOI10.1016/j.ejor.2023.06.002OpenAlexW4379382980MaRDI QIDQ6096617
Christian Almeder, Daryna Dziuba
Publication date: 15 September 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.06.002
Cites Work
- A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Lagrangean relaxation based heuristics for lot sizing with setup times
- A simple heuristic for the multi-item single level capacitated lotsizing problem
- Designing new heuristics for the capacitated lot sizing problem by genetic programming
- Single-item dynamic lot-sizing problems: an updated survey
- An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times
- Handbook of stochastic models and analysis of manufacturing system operations
- Simultaneous lotsizing and scheduling problems: a classification and review of models
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- The multi-item capacitated lot-sizing problem with setup times and shortage costs
- Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem
- Dynamic Version of the Economic Lot Size Model
- A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Computational Complexity of the Capacitated Lot Size Problem
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Predictive Search for Capacitated Multi-Item Lot Sizing Problems
- Modeling industrial lot sizing problems: a review
This page was built for publication: New construction heuristic for capacitated lot sizing problems
