Pages that link to "Item:Q5388050"
From MaRDI portal
The following pages link to Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size (Q5388050):
Displaying 16 items.
- Capacitated lot sizing problems with inventory bounds (Q492789) (← links)
- Single item lot-sizing with non-decreasing capacities (Q847825) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs (Q1728316) (← links)
- NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract (Q1752828) (← links)
- An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels (Q1753642) (← links)
- Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost (Q1758285) (← links)
- Production lot-sizing with dynamic capacity adjustment (Q1991128) (← links)
- Subcontracting and lot-sizing with constant capacities (Q2133416) (← links)
- The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases (Q2355864) (← links)
- Discrete multi-module capacitated lot-sizing problems with multiple items (Q2670496) (← links)
- Improved algorithms for dynamic lot sizing problems with incremental discount (Q4646677) (← links)
- Multiechelon Lot Sizing: New Complexities and Inequalities (Q5131474) (← links)
- A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs (Q6106968) (← links)
- Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups (Q6113320) (← links)
- Economic lot sizing problem with tank scheduling (Q6167403) (← links)
