Approximation Formulations for the Single-Product Capacitated Lot Size Problem

DOI10.1287/opre.34.1.63zbMath0604.90045OpenAlexW2007400936MaRDI QIDQ3741359

Gabriel R. Bitran, Hirofumi Matsuo

Publication date: 1986

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

Full work available at URL: http://hdl.handle.net/1721.1/5178

zbMATH Keywords

error boundsapproximationscapacity constraintssingle-product lot-size problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Related Items

Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ A single-item economic lot-sizing problem with a non-uniform resource: Approximation ⋮ An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure ⋮ Applying particle swarm optimisation to dynamic lot sizing with batch ordering ⋮ Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem ⋮ Um modelo de otimização para o problema integrado de dimensionamento de lotes e programação da produção em fábricas de refrigerantes ⋮ COMBINING PROCESS SELECTION AND LOT SIZING MODELS FOR PRODUCTION SCHEDULING OF ELECTROFUSED GRAINS ⋮ Lot sizing and scheduling -- survey and extensions ⋮ Facets and algorithms for capacitated lot sizing ⋮ A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure ⋮ A new characterization for the dynamic lot size problem with bounded inventory