A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
DOI10.1016/J.COR.2013.01.021zbMATH Open1348.90425OpenAlexW2140029088MaRDI QIDQ336386FDOQ336386
Authors: Canrong Zhang, Zhe Liang, Stephen C. H. Leung, Tao Wu 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.01.021
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
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Nonlinear Programming
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Title not available (Why is that?)
- Capacitated lot-sizing and scheduling by Lagrangean relaxation
- The capacitated lot-sizing problem with linked lot sizes
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- Uncapacitated lot sizing with backlogging: the convex hull
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- 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
- Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- 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
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
- A heuristic approach for big bucket multi-level production planning problems
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
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
Uses Software
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)
