Pages that link to "Item:Q856668"
From MaRDI portal
The following pages link to A polynomial algorithm for the production/ordering planning problem with limited storage (Q856668):
Displaying 13 items.
- Effective replenishment policies for the multi-item dynamic lot-sizing problem with storage capacities (Q336647) (← links)
- Stochastic lot-sizing problem with inventory-bounds and constant order-capacities (Q613461) (← links)
- A branch-and-price algorithm for an integrated production and inventory routing problem (Q991383) (← links)
- A polynomial algorithm for a multi-item capacitated production planning problem (Q1316097) (← links)
- An \(O(T\log T)\) algorithm for the dynamic lot size problem with limited storage and linear costs (Q1888151) (← links)
- Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories (Q2002849) (← links)
- Multi-item uncapacitated lot sizing problem with inventory bounds (Q2257083) (← links)
- The integrated production-inventory-distribution-routing problem (Q2268506) (← links)
- An efficient approach for solving the lot-sizing problem with time-varying storage capacities (Q2482746) (← links)
- Dynamic lot-sizing model under perishability, substitution, and limited storage capacity (Q2664318) (← links)
- Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging (Q3120555) (← links)
- Polynomial-Time Solvability of Dynamic Lot Size Problems (Q3188765) (← links)
- Algorithm for turnpike policies in the dynamic lot size model (Q4895384) (← links)
