Pages that link to "Item:Q2846418"
From MaRDI portal
The following pages link to Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times (Q2846418):
Displaying 11 items.
- Queuing with future information (Q744387) (← links)
- Single-item dynamic lot-sizing problems: an updated survey (Q1694825) (← links)
- Dynamic lot sizing with stochastic demand timing (Q2140333) (← links)
- Process quality adjusted lot sizing and marketing interface in JIT environment (Q2292381) (← links)
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories (Q2935312) (← links)
- Knowledge You Can Act on: Optimal Policies for Assembly Systems with Expediting and Advance Demand Information (Q2957462) (← links)
- Provably Near-Optimal Balancing Policies for Multi-Echelon Stochastic Inventory Control Models (Q2976153) (← links)
- Approximation Algorithms for Perishable Inventory Systems (Q3450462) (← links)
- Confidence Intervals for Data-Driven Inventory Policies with Demand Censoring (Q5131460) (← links)
- Approximation Algorithm for the Stochastic Multiperiod Inventory Problem via a Look-Ahead Optimization Approach (Q5247610) (← links)
- Technical Note—Approximation Algorithms for Perishable Inventory Systems with Setup Costs (Q5740220) (← links)
