Pages that link to "Item:Q1785294"
From MaRDI portal
The following pages link to A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows (Q1785294):
Displaying 10 items.
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062) (← links)
- Lot sizing with minimum order quantity (Q479047) (← links)
- NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828) (← links)
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (Q1758285) (← links)
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs (Q1926904) (← links)
- Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities (Q2190277) (← links)
- A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities (Q2244219) (← links)
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases (Q2355864) (← links)
- Lot-sizing with production and delivery time windows (Q2492704) (← links)
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount (Q2669493) (← links)
