Single-item lot-sizing with quantity discount and bounded inventory
From MaRDI portal
Publication:2670451
Recommendations
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
- Dynamic lot sizing with all-units discount and resales
- Polynomial cases of the economic lot sizing problem with cost discounts
- The dynamic lot size model with quantity discount
- Lot sizing with piecewise concave production costs
Cites work
- A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
- A note on ``The economic lot sizing problem with inventory bounds
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Computational Complexity of the Capacitated Lot Size Problem
- Economic lot sizing problem with inventory bounds
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
- Joint optimization of dynamic lot and warehouse sizing problems
- Lot sizing with piecewise concave production costs
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
- Single-item dynamic lot-sizing problems: an updated survey
- The dynamic lot size model with quantity discount
Cited in
(2)
This page was built for publication: Single-item lot-sizing with quantity discount and bounded inventory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2670451)