On the computational complexity of uncapacitated multi-plant lot-sizing problems
From MaRDI portal
Abstract: Production and inventory planning have become crucial and challenging in nowadays competitive industrial and commercial sectors, especially when multiple plants or warehouses are involved. In this context, this paper addresses the complexity of uncapacitated multi-plant lot-sizing problems. We consider a multi-item uncapacitated multi-plant lot-sizing problem with fixed transfer costs and show that two of its very restricted special cases are already NP-hard. Namely, we show that the single-item uncapacitated multi-plant lot-sizing problem with a single period and the multi-item uncapacitated two-plant lot-sizing problem with fixed transfer costs are NP-hard. Furthermore, as a direct implication of the proven results, we also show that a two-echelon multi-item lot-sizing with joint setup costs on transportation is NP-hard.
Recommendations
- Computational complexity of uncapacitated multi-echelon production planning problems
- Multi-item uncapacitated lot sizing problem with inventory bounds
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
- Multiechelon Lot Sizing: New Complexities and Inequalities
Cites work
- scientific article; zbMATH DE number 4202014 (Why is no real title available?)
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers
- A heuristic procedure for solving multi-plant, multi-item, multi-period capacitated lot-sizing problems
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over
- An integrated approach for production and distribution planning in supply chain management
- Computational Complexity of the Capacitated Lot Size Problem
- Computational complexity of uncapacitated multi-echelon production planning problems
- Dynamic version of the economic lot size model
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
- MIP formulations and heuristics for two-level production-transportation problems
- Modeling industrial lot sizing problems: a review
- Multi-item uncapacitated lot sizing problem with inventory bounds
- On reformulations for the one-warehouse multi-retailer problem
- Production Planning by Mixed Integer Programming
- Single-item dynamic lot-sizing problems: an updated survey
- Uncapacitated two-level lot-sizing
Cited in
(5)- A modified variable neighborhood search algorithm for dynamic lot-sizing with supplier selection under varying delivery time quotation
- Multi-item uncapacitated lot sizing problem with inventory bounds
- On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]
- The periodic joint replenishment problem is strongly \(\mathcal{NP} \)-hard
- Computational complexity of uncapacitated multi-echelon production planning problems
This page was built for publication: On the computational complexity of uncapacitated multi-plant lot-sizing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828705)
