Pages that link to "Item:Q4545665"

The following pages link to A Simple Heuristic for Computing Nonstationary (s, S) Policies (Q4545665):

Displayed 15 items.

• Computing non-stationary \((s, S)\) policies using mixed integer linear programming (Q724127) ‎ (← links)
• Solving a class of simulation-based optimization problems using ``optimality in probability'' (Q1745940) ‎ (← links)
• The multi-sourcing location inventory problem with stochastic demand (Q1754058) ‎ (← links)
• Continuous inventory control with stochastic and non-stationary Markovian demand (Q1754744) ‎ (← links)
• Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming (Q2031075) ‎ (← links)
• Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy (Q2076831) ‎ (← links)
• A study on the optimal inventory allocation for clinical trial supply chains (Q2247342) ‎ (← links)
• Optimal inventory control with fixed ordering cost for selling by Internet auctions (Q2358842) ‎ (← links)
• An efficient lot-sizing heuristic for a periodic-review inventory system under non-stationary stochastic demand (Q2476427) ‎ (← links)
• Constraint programming for computing non-stationary \((R, S)\) inventory policies (Q2482781) ‎ (← links)
• Big data driven order-up-to level model: application of machine learning (Q2669807) ‎ (← links)
• Optimal and Near-Optimal (<i>s,S</i>) Inventory Policies for Levy Demand Processes (Q2765598) ‎ (← 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)
• Optimal Inventory Control and Allocation for Sequential Internet Auctions (Q5255179) ‎ (← links)