A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
From MaRDI portal
Publication:2907902
zbMATH Open1246.90047MaRDI QIDQ2907902FDOQ2907902
Authors: K. Haugen, G. Lanquepin-Chesnais, A. Olstad 
Publication date: 4 September 2012
Published in: Kybernetika (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/246843
Recommendations
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- A Lagrangian heuristic for capacitated single item lot sizing problems
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Analysis Of Lagrangian Decomposition For The Multi-Item Capacitated Lot-Sizing Problem
- LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Cites Work
- Dynamic version of the economic lot size model
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Computational Complexity of the Capacitated Lot Size Problem
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
- A new heuristic approach for the multi-item dynamic lot sizing problem
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- The profit maximizing capacitated lot-size (PCLSP) problem
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Approximate scenario solutions in the progressive hedging algorithm. A numerical study with an application to fisheries management
- Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
- The single (and multi) item profit maximizing capacitated lot-size (PCLSP) problem with fixed prices and no set-up
Cited In (6)
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
- Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- A Lagrangian heuristic for capacitated single item lot sizing problems
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
Uses Software
This page was built for publication: A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907902)
