Multi-item, multi-facility supply chain planning: Models, complexities, and algorithms

DOI10.1023/B:COAP.0000033967.18695.9DzbMath1084.90013OpenAlexW2122356413MaRDI QIDQ1888153

Hakan Golbasi, S. David Wu

Publication date: 22 November 2004

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:coap.0000033967.18695.9d

zbMATH Keywords

analysis of algorithmsNP-completenessmixed integer programminglot sizingSupply chain optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

An effective heuristic for multi-period multi-foodgrain inventory transportation problem in India ⋮ Mathematical programming model for centralised master planning in ceramic tile supply chains ⋮ A new mixed integer linear programming model for the multi level uncapacitated facility location problem ⋮ Exact algorithms for integrated facility location and production planning problems ⋮ GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This page was built for publication: Multi-item, multi-facility supply chain planning: Models, complexities, and algorithms