Capacitated lot sizing problems with inventory bounds

DOI10.1007/s10479-015-1816-6zbMath1318.90026OpenAlexW2008685592MaRDI QIDQ492789

Ayse Akbalik, Bernard Penz, Christophe Rapine

Publication date: 21 August 2015

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-1816-6

zbMATH Keywords

complexitydynamic programmingmulti-itemlot sizing probleminventory boundssingle-item

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (7)

Scheduling the replenishment of just-in-time supermarkets in assembly plants ⋮ Dynamic lot-sizing model under perishability, substitution, and limited storage capacity ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Unnamed Item ⋮ A branch-and-cut algorithm for an assembly routing problem ⋮ The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity

Cites Work

• Unnamed Item
• Note on ``An efficient approach for solving the lot-sizing problem with time-varying storage capacities
• Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs
• An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs
• A note on ``The economic lot sizing problem with inventory bounds
• Multi-item uncapacitated lot sizing problem with inventory bounds
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• Lot-sizing with production and delivery time windows
• Dynamic Version of the Economic Lot Size Model
• Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging
• Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
• Deterministic Production Planning: Algorithms and Complexity
• An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
• Computational Complexity of the Capacitated Lot Size Problem
• 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 Constant Batches: Formulation and Valid Inequalities
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
• Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size

This page was built for publication: Capacitated lot sizing problems with inventory bounds