Pages that link to "Item:Q1327429"
From MaRDI portal
The following pages link to A dynamic programming algorithm for dynamic lot size models with piecewise linear costs (Q1327429):
Displaying 11 items.
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time (Q613509) (← links)
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs (Q1752258) (← links)
- Joint optimization of dynamic lot and warehouse sizing problems (Q1754258) (← links)
- Minimizing the error bound for the dynamic lot size model (Q1904609) (← links)
- Economic lot sizing: the capacity reservation model (Q2450755) (← links)
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
- Feasible Sequential Decisions and a Flexible Lagrangean‐Based Heuristic for Dynamic Multi‐Level Lot Sizing (Q3842990) (← links)
- Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
- Combined replenishment and warehousing with contract commitments and flexibilities (Q6053128) (← links)
