scientific article; zbMATH DE number 7695059

DOI10.22124/jmm.2022.22637.2002zbMath1524.90043MaRDI QIDQ6098193

Maziar Salahi, Unnamed Author

Publication date: 13 June 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

mixed integer linear programmingcapacitated lot-sizingwarehouse layoutheuristics algorithm

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
• Capacitated lot sizing problems with inventory bounds
• Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design
• Analysis of a dynamic lot-sizing problem with production capacity constraint
• Multi-Product Inventory Situations with One Restriction
• A Facilities in Series Inventory Model with Nested Schedules

This page was built for publication: