On the computational complexity of uncapacitated multi-plant lot-sizing problems
From MaRDI portal
Publication:828705
DOI10.1007/s11590-020-01615-xzbMath1466.90054arXiv2003.04438OpenAlexW3102124631MaRDI QIDQ828705
Rafael A. Melo, Jesus Ossian Cunha, Hugo Harry Kramer
Publication date: 5 May 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.04438
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- On reformulations for the one-warehouse multi-retailer problem
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- Uncapacitated two-level lot-sizing
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Computational complexity of uncapacitated multi-echelon production planning problems
- Single-item dynamic lot-sizing problems: an updated survey
- MIP formulations and heuristics for two-level production-transportation problems
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- Multi-item uncapacitated lot sizing problem with inventory bounds
- Dynamic Version of the Economic Lot Size Model
- Computational Complexity of the Capacitated Lot Size Problem
- Modeling industrial lot sizing problems: a review
- An integrated approach for production and distribution planning in supply chain management
- Production Planning by Mixed Integer Programming
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Unnamed Item
- Unnamed Item
This page was built for publication: On the computational complexity of uncapacitated multi-plant lot-sizing problems
