Capacitated lot sizing problems with inventory bounds

DOI10.1007/S10479-015-1816-6zbMATH Open1318.90026OpenAlexW2008685592MaRDI QIDQ492789FDOQ492789

Authors: 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

Recommendations

• Multi-item uncapacitated lot sizing problem with inventory bounds
• Two-level lot-sizing with inventory bounds
• Economic lot sizing problem with inventory bounds
• Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
• An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem

zbMATH Keywords

dynamic programmingcomplexitymulti-itemlot sizing probleminventory boundssingle-item

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Dynamic version of the economic lot size model
• Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
• Deterministic Production Planning: Algorithms and Complexity
• Lot-Sizing with Constant Batches: Formulation and Valid Inequalities
• Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
• Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Lot-sizing with production and delivery time windows
• Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
• Computational Complexity of the Capacitated Lot Size Problem
• Bounded Production and Inventory Models with Piecewise Concave Costs
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation
• Analysis of relaxations for the multi-item capacitated lot-sizing problem
• 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
• An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
• Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
• 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
• An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs

Cited In (22)

• A capacity expansion problem with budget constraint and bottleneck limitation
• Multi-item uncapacitated lot sizing problem with inventory bounds
• Scheduling the replenishment of just-in-time supermarkets in assembly plants
• Solving the capacitated lot-sizing problem with backorder consideration
• Analysis of bounds for a capacitated single-item lot-sizing problem
• Single-item dynamic lot-sizing problems: an updated survey
• A single-item lot-sizing problem with a by-product and inventory capacities
• The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity
• Capacitated lot-sizing problem with outsourcing
• Lot sizing with bounded inventory and lost sales
• Multilevel Lot-Sizing with Inventory Bounds
• Two efficient heuristic algorithms for the integrated production planning and warehouse layout problem
• The multi-item capacitated lot-sizing problem with safety stocks and demand shortage costs
• A branch-and-cut algorithm for an assembly routing problem
• Two-level lot-sizing with inventory bounds
• Capacitated lot sizing with alternative routings and overtime decisions
• Stochastic lot-sizing problem with inventory-bounds and constant order-capacities
• 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
• Economic lot sizing problem with inventory bounds
• The item dependent stockingcost constraint
• Models and Lagrangian heuristics for a two-level lot-sizing problem with bounded inventory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492789)