A Benders decomposition based heuristic for the hierarchical production planning problem

DOI10.1016/0377-2217(90)90151-ZzbMath0692.90057OpenAlexW2008509284MaRDI QIDQ584066

Karen Aardal, Torbjörn Larsson

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90151-z

zbMATH Keywords

bounds for the optimal valueheuristic procedureshierarchical production planningmixed integer- real linear optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Production models (90B30) Hierarchical systems (93A13) Decomposition methods (49M27)

Related Items (8)

On using approximations of the Benders master problem ⋮ New bounding and decomposition approaches for MILP investment problems: multi-area transmission and generation planning under policy constraints ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ The Benders decomposition algorithm: a literature review ⋮ A demand-shifting feasibility algorithm for Benders decomposition. ⋮ Disaggregation to a rolling horizon master production schedule with minimum batch-size production restrictions ⋮ Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large-scale mixed integer programming: Benders-type heuristics
• An O(n) algorithm for quadratic knapsack problems
• Partitioning procedures for solving mixed-variables programming problems
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• Dynamic Version of the Economic Lot Size Model
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Analytical Evaluation of Hierarchical Planning Systems
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Topological optimization of networks: A nonlinear mixed integer model employing generalized Benders decomposition
• Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
• On convergence rates of subgradient optimization methods
• Validation of subgradient optimization
• An Efficient Algorithm for Multi-Item Scheduling

This page was built for publication: A Benders decomposition based heuristic for the hierarchical production planning problem