A modeling and hybridized decomposition approach for the multi-level capacitated lot-sizing problem with setup carryover, backlogging, and emission control

Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)

Cites Work

The economic lot-sizing problem with an emission capacity constraint
Hybrid methods for lot sizing on parallel machines
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures
A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
The carbon-constrained EOQ
Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms
A generic view of Dantzig--Wolfe decomposition in mixed integer programming
Dantzig-Wolfe decomposition for the facility location and production planning problem
Dynamic Version of the Economic Lot Size Model
A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm 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
Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
Deterministic Production Planning: Algorithms and Complexity
Computational Complexity of the Capacitated Lot Size Problem
A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
The setup carryover assignment problem

This page was built for publication: A modeling and hybridized decomposition approach for the multi-level capacitated lot-sizing problem with setup carryover, backlogging, and emission control