A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
type: Item
instance of: scholarly article
title: A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
zbMATH Open document ID: 1177.90022
author: J. Blot
published in: European Journal of Operational Research
publication date: 2009-12-14T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 5646329
zbMATH Keywords: capacitated economic lot-sizing problem
zbMATH Keywords: fully polynomial time approximation scheme
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.01.040
OpenAlex ID: W1969621509
cites work: An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
cites work: Approximation Formulations for the Single-Product Capacitated Lot Size Problem
cites work: Computational Complexity of the Capacitated Lot Size Problem
cites work: A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
cites work: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
cites work: An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
cites work: A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
cites work: Deterministic Production Planning: Algorithms and Complexity
cites work: Deterministic Production Planning with Concave Costs and Capacity Constraints
cites work: A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
cites work: An efficient algorithm for the capacitated single item dynamic lot size problem
cites work: An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs
cites work: Lot-sizing with non-stationary cumulative capacities
cites work: An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
cites work: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
cites work: Integrated Lot Sizing in Serial Supply Chains with Production Capacities
DOI: 10.1016/J.EJOR.2009.01.040
Recommended article: An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
Recommended article: An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand
Recommended article: An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
Recommended article: Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
Recommended article: A Lagrangian heuristic for capacitated single item lot sizing problems
Recommended article: Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs
Recommended article: A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
Recommended article: An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost
Recommended article: Analysis of bounds for a capacitated single-item lot-sizing problem
Recommended article: An Algorithm for the Single-item Capacitated Lot-Sizing Problem with Concave Production and Holding Costs
description: scientific article; zbMATH DE number 5646329