A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
DOI10.1287/OPRE.38.1.70zbMATH Open0714.90050OpenAlexW2088377090MaRDI QIDQ3200871FDOQ3200871
Authors: Bezalel Gavish, Robert E. Johnson 
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
Recommendations
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem
- Polynomial algorithms for single machine scheduling problems with financial constraints
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- scientific article; zbMATH DE number 4170628
- Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases
- Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs
- A polynomial algorithm for a multi-item capacitated production planning problem
- A polyhedral approach to single-machine scheduling problems.
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost
lot sizingsingle facilityfully polynomial approximationdeterministic dynamic demandsfinite capacity facilityfinite continuous time planning horizonsingle-product schedulingtiming of production lots
Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30)
Cited In (14)
- Finite horizon planning with fixed-interval deliveries and no shortage
- Approximation Formulations for the Single-Product Capacitated Lot Size Problem
- Single-item dynamic lot-sizing problems: an updated survey
- An FPTAS for SM-CELS problem with monotone cost functions
- Scheduling concurrent production over a finite planning horizon: Polynomially solvable cases
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- Polynomial algorithms for single machine scheduling problems with financial constraints
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time
- 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
- Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation
- Single item lot sizing problems
This page was built for publication: A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200871)
