An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem

DOI10.1016/0305-0548(93)90085-WzbMath0772.90040OpenAlexW2089683907MaRDI QIDQ1260745

Harvey H. Millar, Minzhu Yang

Publication date: 25 August 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(93)90085-w

zbMATH Keywords

subgradient optimizationLagrangean decompositioncapacitated multi-item lost sizing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (4)

Capacitated lot-sizing with extensions: a review ⋮ Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks ⋮ An integrated model for inventory and production planning in a two-stage hybrid production system ⋮ Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over

Cites Work

• Layering strategies for creating exploitable structure in linear and integer programs
• Facets and algorithms for capacitated lot sizing
• An application-oriented guide for designing Lagrangean dual ascent algorithms
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
• Dynamic Version of the Economic Lot Size Model
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
• Primal transportation and transshipment algorithms
• Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks
• Computational Complexity of the Capacitated Lot Size Problem
• Multi-Item Lot Size Scheduling by Heuristic Part I: With Fixed Resources
• Validation of subgradient optimization
• A Deterministic Multi-Period Production Scheduling Model with Backlogging
• An Efficient Algorithm for Multi-Item Scheduling

This page was built for publication: An application of Lagrangean decomposition to the capacitated multi-item lot sizing problem