Two-level lot-sizing with inventory bounds

DOI10.1016/j.disopt.2018.05.001zbMath1454.90006arXiv1604.02278MaRDI QIDQ1756341

Siao-Leu Phouratsamay, Safia Kedad-Sidhoum, Fanny Pascual

Publication date: 14 January 2019

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.02278

zbMATH Keywords

NP-hardness; dynamic lot-sizing; inventory bounds; polynomial dynamic programming algorithm

Mathematics Subject Classification ID

90B05: Inventory, storage, reservoirs

90C39: Dynamic programming

90C23: Polynomial optimization

Related Items

A branch-and-cut algorithm for an assembly routing problem, Dynamic lot-sizing model under perishability, substitution, and limited storage capacity

Cites Work

• Unnamed Item
• Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities
• An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
• Uncapacitated two-level lot-sizing
• A note on ``The economic lot sizing problem with inventory bounds
• Economic lot sizing problem with inventory bounds
• An efficient approach for solving the lot-sizing problem with time-varying storage capacities
• Integrated Lot Sizing in Serial Supply Chains with Production Capacities
• Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging
• A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
• Deterministic Production Planning: Algorithms and Complexity
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Bounded Production and Inventory Models with Piecewise Concave Costs
• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
• Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem
• Minimum Concave Cost Flows in Certain Networks
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach