A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
From MaRDI portal
Publication:3200871
DOI10.1287/opre.38.1.70zbMath0714.90050OpenAlexW2088377090MaRDI QIDQ3200871
Robert E. Johnson, Bezalel Gavish
Publication date: 1990
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.38.1.70
lot sizingsingle facilityfully polynomial approximationdeterministic dynamic demandsfinite capacity facilityfinite continuous time planning horizonsingle-product schedulingtiming of production lots
Applications of mathematical programming (90C90) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Dynamic programming (90C39)
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, Lagrangean relaxation based heuristics for lot sizing with setup times, Optimal production plans and shipment schedules in a supply-chain system with multiple suppliers and multiple buyers, A single-item economic lot-sizing problem with a non-uniform resource: Approximation, Finite horizon planning with fixed-interval deliveries and no shortage, A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure, Single item lot sizing problems
