A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders

DOI10.1016/j.cor.2013.01.021zbMath1348.90425OpenAlexW2140029088MaRDI QIDQ336386

Canrong Zhang, Stephen C. H. Leung, Zhe Liang, 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

zbMATH Keywords

optimizationheuristicsLagrangian relaxationmixed integer programmingproduction planninglot sizing

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)

Related Items (5)

The green capacitated multi-item lot sizing problem with parallel machines ⋮ Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Data-driven branching and selection for lot-sizing and scheduling problems with sequence-dependent setups and setup carryover ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Uncapacitated lot sizing with backlogging: the convex hull
• A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
• Lot-size models with backlogging: Strong reformulations and cutting planes
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• 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
• The Capacitated Lot-Sizing Problem with Linked Lot Sizes
• 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
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
• Nonlinear Programming

This page was built for publication: A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders