Algorithms and Planning Horizon Results for Production Planning Problems with Separable Costs

DOI10.1287/OPRE.27.5.874zbMATH Open0424.90027OpenAlexW2010666245MaRDI QIDQ3859544FDOQ3859544

Authors: Zvi Lieber, Paul R. Kleindorfer 

Publication date: 1979

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.27.5.874

zbMATH Keywords

decomposition methodsproduction planningemployment smoothing problemsModigliani-Hohn production scheduling problemseparable costssubgradient optimization algorithm

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Production models (90B30)

Cited In (5)

• Computing minimal forecast horizons: an integer programming approach
• A forward maximum principle algorithm with decision horizon results
• Decision and forecast horizons in a stochastic environment: A survey
• Strong planning and forecast horizons for a model with simultaneous price and production decisions
• Overview of Production Planning

This page was built for publication: Algorithms and Planning Horizon Results for Production Planning Problems with Separable Costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3859544)