Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost

DOI10.1016/j.orl.2012.05.003zbMath1250.90081OpenAlexW2084963782MaRDI QIDQ1758285

Ayse Akbalik, Christophe Rapine

Publication date: 8 November 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2012.05.003

zbMATH Keywords

dynamic programmingpolynomial time algorithmcapacitated lot sizing problemsingle-itemstepwise costs

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Related Items (10)

Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ <scp>Decomposition‐based</scp> approximation algorithms for the <scp>one‐warehouse multi‐retailer</scp> problem with concave batch order costs ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Economic lot sizing problem with tank scheduling ⋮ Production lot-sizing with dynamic capacity adjustment ⋮ NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract ⋮ Integrated inventory routing and freight consolidation for perishable goods ⋮ Analysis of a dynamic lot-sizing problem with production capacity constraint ⋮ Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs ⋮ The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases

Cites Work

• Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
• Dynamic Version of the Economic Lot Size Model
• Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs
• A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse
• 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
• 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
• Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
• Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
• Production Planning by Mixed Integer Programming
• Optimal Inventory Policy with Multiple Set-Up Costs

This page was built for publication: Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost