Improved algorithms for dynamic lot sizing problems with incremental discount
From MaRDI portal
Publication:4646677
Recommendations
- Polynomial cases of the economic lot sizing problem with cost discounts
- Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
- Dynamic lot sizing with all-units discount and resales
- Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount
- Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
Cites work
- A Deterministic Multi-Period Production Planning Model with Piecewise Concave Production and Holding-Backorder Costs
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
- A dynamic quantity discount lot size model with resales
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
- An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
- An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
- Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
- Dynamic lot sizing with all-units discount and resales
- Dynamic version of the economic lot size model
- Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case
- Economic lot sizing with constant capacities and concave inventory costs
- Economic lot sizing: the capacity reservation model
- Facets and algorithms for capacitated lot sizing
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- Improved Algorithms for Economic Lot Size Problems
- Improved algorithms for a lot-sizing problem with inventory bounds and backlogging
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
- Lot sizing with piecewise concave production costs
- Minimum Concave Cost Flows in Certain Networks
- On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
- Polynomial cases of the economic lot sizing problem with cost discounts
- The dynamic lot size model with quantity discount
- The dynamic lot size model with quantity discount: Counterexamples and correction
- Using geometric techniques to improve dynamic programming algorithms for the economic lot-sizing problem and extensions
Cited in
(6)- An improved algorithm for the dynamic lot-sizing problem with learning effect in setups
- A perfect lot-tree procedure for the discounted dynamic lot-size problem with speculation
- A modified Silver–Meal heuristic for dynamic lot sizing under incremental quantity discounts
- Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount
- Dynamic Lot Sizing with Batch Ordering and Truckload Discounts
- Polynomial cases of the economic lot sizing problem with cost discounts
This page was built for publication: Improved algorithms for dynamic lot sizing problems with incremental discount
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646677)
