Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
DOI10.1007/S10852-006-9053-2zbMATH Open1143.90003OpenAlexW2010822732MaRDI QIDQ2369969FDOQ2369969
Authors: Kjetil K. Haugen, A. Olstad, Bård I. Pettersen 
Publication date: 21 June 2007
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-006-9053-2
Recommendations
- A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
- An improved heuristic for the capacitated lot-sizing problem
- Efficient and effective heuristics for the coordinated capacitated lot-size problem
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- The profit maximizing capacitated lot-size (PCLSP) problem
- A Lagrangian heuristic for capacitated single item lot sizing problems
- A heuristic procedure for the capacitated lot sizing problem with setup carry-over
- A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems
- A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Integer programming (90C10) Inventory, storage, reservoirs (90B05)
Cites Work
- Dynamic pricing in the presence of inventory considerations: research overview, current practices, and future directions
- Validation of subgradient optimization
- Deterministic Production Planning: Algorithms and Complexity
- Title not available (Why is that?)
- Analysis of relaxations for the multi-item capacitated lot-sizing problem
- Progressive hedging as a meta-heuristic applied to stochastic lot-sizing
- Multilevel capacitated lotsizing complexity and LP-based heuristics
- Price-Production Decisions with Deterministic Demand
- 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
Cited In (7)
- A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
- The profit maximizing capacitated lot-size (PCLSP) problem
- Joint dynamic pricing and lot-sizing under competition
- Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set
- Profit maximization in simultaneous lot-sizing and scheduling problem
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
- The single (and multi) item profit maximizing capacitated lot-size (PCLSP) problem with fixed prices and no set-up
Uses Software
This page was built for publication: Solving large-scale profit maximization capacitated lot-size problems by heuristic methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369969)
