Pages that link to "Item:Q858399"
From MaRDI portal
The following pages link to Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand (Q858399):
Displaying 27 items.
- Demand seasonality in retail inventory management (Q296797) (← links)
- Confidence-based optimisation for the newsvendor problem under binomial, Poisson and exponential demand (Q297378) (← links)
- The stochastic lot sizing problem with piecewise linear concave ordering costs (Q342128) (← links)
- Service level robustness in stochastic production planning under random machine breakdowns (Q421490) (← links)
- Computing non-stationary \((s, S)\) policies using mixed integer linear programming (Q724127) (← links)
- Cost-based filtering techniques for stochastic inventory control under service level constraints (Q842783) (← links)
- On the stochastic uncapacitated dynamic single-item lotsizing problem with service level constraints (Q872255) (← links)
- Multiple items procurement under stochastic nonstationary demands (Q1390261) (← links)
- Piecewise linear lower and upper bounds for the standard normal first order loss function (Q1644563) (← links)
- A reformulation for the stochastic lot sizing problem with service-level constraints (Q1667211) (← links)
- An optimization of \((Q, r)\) inventory policy based on health care apparel products with compound Poisson demands (Q1719540) (← links)
- Optimizing (\(s, S\)) policies for multi-period inventory models with demand distribution uncertainty: robust dynamic programing approaches (Q1753637) (← links)
- Continuous inventory control with stochastic and non-stationary Markovian demand (Q1754744) (← links)
- Constraint programming for stochastic inventory systems under shortage cost (Q1761863) (← links)
- Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming (Q2031075) (← links)
- Inventory systems with stochastic and batch demand: computational approaches (Q2069246) (← links)
- Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy (Q2076831) (← links)
- Constraint programming for computing non-stationary \((R, S)\) inventory policies (Q2482781) (← links)
- A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times (Q2668748) (← links)
- Constraint-based local search for inventory control under stochastic demand and lead time (Q2815430) (← links)
- Computing a Stationary Base-Stock Policy for a Finite Horizon Stochastic Inventory Problem with Non-linear Shortage Costs (Q3158159) (← links)
- A static-dynamic strategy for spare part inventory systems with nonstationary stochastic demand (Q3161781) (← links)
- A mixed 0‐1 integer programming for inventory model (Q3639299) (← links)
- A Simple Heuristic for Computing Nonstationary (s, S) Policies (Q4545665) (← links)
- Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution (Q5060792) (← links)
- An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem (Q5136076) (← links)
- Service-Level Oriented Lot Sizing Under Stochastic Demand (Q5391944) (← links)
