Multi-period lot-sizing with supplier selection: structural results, complexity and algorithms
From MaRDI portal
Publication:2060614
DOI10.1016/j.orl.2021.05.013MaRDI QIDQ2060614
Guohua Wan, Meichun Lin, Woonghee Tim Huh
Publication date: 13 December 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2021.05.013
90-XX: Operations research, mathematical programming
91-XX: Game theory, economics, finance, and other social and behavioral sciences
Cites Work
- Unnamed Item
- A new approach to solve the multi-product multi-period inventory lot sizing with supplier selection problem
- Computational complexity of uncapacitated multi-echelon production planning problems
- Single-item dynamic lot-sizing problems: an updated survey
- The simple plant location problem: Survey and synthesis
- Inventory lot-sizing with supplier selection
- A review of the joint replenishment problem literature: 1989--2005
- Single item lot sizing problems
- Dynamic Version of the Economic Lot Size Model
- Worst-Case Analysis for a General Class of Online Lot-Sizing Heuristics
- Deterministic Production Planning: Algorithms and Complexity
- Computational Complexity of the Capacitated Lot Size Problem
- Multiechelon Lot Sizing: New Complexities and Inequalities
- A Deterministic Multi-Period Production Scheduling Model with Backlogging