Feasible Sequential Decisions and a Flexible Lagrangean‐Based Heuristic for Dynamic Multi‐Level Lot Sizing
From MaRDI portal
Publication:3842990
DOI10.1111/j.1475-3995.1997.tb00089.xzbMath0911.90141OpenAlexW4245243408MaRDI QIDQ3842990
Publication date: 20 August 1998
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.1997.tb00089.x
Lagrangian relaxationLagrangean-based heuristicacyclic product structuredynamic multi-level lot sizingflexible planningunconstrained resources
Related Items (2)
Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach ⋮ A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test
Cites Work
- Deterministic lotsizing models for production planning
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
- Dynamic Version of the Economic Lot Size Model
- Comparative analysis of lot-sizing models for multi-stage systems: a simulation study
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- Validation of subgradient optimization
This page was built for publication: Feasible Sequential Decisions and a Flexible Lagrangean‐Based Heuristic for Dynamic Multi‐Level Lot Sizing