A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
From MaRDI portal
Publication:336386
Recommendations
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
- Solving the capacitated lot-sizing problem with backorder consideration
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Lot-size models with backlogging: Strong reformulations and cutting planes
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3568353 (Why is no real title available?)
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- A heuristic approach for big bucket multi-level production planning problems
- A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
- Lot-size models with backlogging: Strong reformulations and cutting planes
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Nonlinear Programming
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- The capacitated lot-sizing problem with linked lot sizes
- Uncapacitated lot sizing with backlogging: the convex hull
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Cited in
(7)- An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Solving the capacitated lot-sizing problem with backorder consideration
- Predictive search for capacitated multi-item lot sizing problems
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- The green capacitated multi-item lot sizing problem with parallel machines
- Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover
This page was built for publication: A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336386)
