Solving large-scale profit maximization capacitated lot-size problems by heuristic methods

DOI10.1007/s10852-006-9053-2zbMath1143.90003OpenAlexW2010822732MaRDI QIDQ2369969

Asmund Olstad, Bård I. Pettersen, Kjetil K. Haugen

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

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)

Related Items (5)

Large-scale joint price-inventory decision problems, under resource limitation and a discrete price set ⋮ Unnamed Item ⋮ Joint dynamic pricing and lot-sizing under competition ⋮ Profit maximization in simultaneous lot-sizing and scheduling problem ⋮ Unnamed Item

Uses Software

• LOQO

Cites Work

• Unnamed Item
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• 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
• The profit maximizing capacitated lot-size (PCLSP) problem
• Dynamic Pricing in the Presence of Inventory Considerations: Research Overview, Current Practices, and Future Directions
• Deterministic Production Planning: Algorithms and Complexity
• A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing
• Validation of subgradient optimization
• Price-Production Decisions with Deterministic Demand
• Progressive hedging as a meta-heuristic applied to stochastic lot-sizing

This page was built for publication: Solving large-scale profit maximization capacitated lot-size problems by heuristic methods