A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
From MaRDI portal
Publication:2907902
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
Cites work
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- A new heuristic approach for the multi-item dynamic lot sizing problem
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Approximate scenario solutions in the progressive hedging algorithm. A numerical study with an application to fisheries management
- Computational Complexity of the Capacitated Lot Size Problem
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Dynamic version of the economic lot size model
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
- Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
- Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
- The profit maximizing capacitated lot-size (PCLSP) problem
- The single (and multi) item profit maximizing capacitated lot-size (PCLSP) problem with fixed prices and no set-up
Cited in
(6)- Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
- Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
- A Lagrangian heuristic for capacitated single item lot sizing problems
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)
