A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure

DOI10.1016/j.ejor.2009.01.040zbMath1177.90022OpenAlexW1969621509MaRDI QIDQ1042524

J. Blot

Publication date: 14 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.040

zbMATH Keywords

fully polynomial time approximation schemecapacitated economic lot-sizing problem

Mathematics Subject Classification ID

Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (7)

Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ Single-item lot-sizing with quantity discount and bounded inventory ⋮ An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ A strongly polynomial FPTAS for the symmetric quadratic knapsack problem ⋮ Lot-sizing with non-stationary cumulative capacities ⋮ NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract

Cites Work

• A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
• An efficient algorithm for the capacitated single item dynamic lot size problem
• A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
• Lot-sizing with non-stationary cumulative capacities
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
• Integrated Lot Sizing in Serial Supply Chains with Production Capacities
• A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
• Approximation Formulations for the Single-Product Capacitated Lot Size Problem
• An O(T²) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
• 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
• An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

This page was built for publication: A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure