A Lagrangian heuristic for capacitated single item lot sizing problems
From MaRDI portal
Publication:2351162
DOI10.1007/s10288-014-0266-3zbMath1317.90208OpenAlexW2054340597MaRDI QIDQ2351162
Stéphane Dauzère-Pérès, Nadjib Brahimi
Publication date: 23 June 2015
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-014-0266-3
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A cash‐constrained dynamic lot‐sizing problem with loss of goodwill and credit‐based loan, Single-item dynamic lot-sizing problems: an updated survey, Dynamic optimization for coordinated replenishment system considering seasonal demand and price quantity discount
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times
- Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
- Analysis of bounds for a capacitated single-item lot-sizing problem
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Capacitated lot-sizing with extensions: a review
- Four equivalent lot-sizing models
- Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- A simple heuristic for the multi-item single level capacitated lotsizing problem
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Dynamic lot-sizing model for major and minor demands
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Lot-sizing with production and delivery time windows
- Single item lot sizing problems
- Dynamic Version of the Economic Lot Size Model
- An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
- Economic lot sizing with constant capacities and concave inventory costs
- Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
- Capacitated Multi-Item Lot-Sizing Problems with Time Windows
- Heuristics for Multilevel Lot-Sizing with a Bottleneck
- Perishable Inventory Theory: A Review
- 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
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Optimum Solution Structure for a Repairable Inventory Problem
- Validation of subgradient optimization
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Dynamic lot‐sizing model with production time windows
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
