Pages that link to "Item:Q1262197"
From MaRDI portal
The following pages link to An efficient algorithm for the capacitated single item dynamic lot size problem (Q1262197):
Displaying 11 items.
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities (Q613461) (← links)
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches (Q857326) (← links)
- A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure (Q1042524) (← links)
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model (Q1318270) (← links)
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs (Q1327429) (← links)
- A new heuristic approach for the multi-item dynamic lot sizing problem (Q1331607) (← links)
- An effective algorithm for the capacitated single item lot size problem (Q1331619) (← links)
- Decision horizons for the capacitated lot size model with inventory bounds and stockouts (Q2368105) (← links)
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches (Q2379665) (← links)
- A single-item economic lot-sizing problem with a non-uniform resource: Approximation (Q2482766) (← links)
- Lot sizing with bounded inventory and lost sales (Q5451189) (← links)
