Pages that link to "Item:Q3216392"

The following pages link to An Efficient Algorithm for Computing Optimal (<i>s</i>, <i>S</i>) Policies (Q3216392):

Displaying 34 items.

• Lost-sales inventory theory: a review (Q421606) (← links)
• Control-limit policies for a class of stopping time problems with termination restrictions (Q499675) (← links)
• New structural properties of (\(s,S\)) policies for inventory models with lost sales (Q613352) (← links)
• An EPQ model with inflation in an imperfect production system (Q632837) (← links)
• Computing non-stationary \((s, S)\) policies using mixed integer linear programming (Q724127) (← links)
• A partial replenishment model for an inventory with constant demand (Q949955) (← links)
• Computing robust basestock levels (Q951115) (← links)
• A finite algorithm for \(\epsilon\)-optimal solutions of adaptive queueing control (Q1099591) (← links)
• Inventory models with general backorder costs (Q1261378) (← links)
• The classical average-cost inventory models of Iglehart and Veinott-Wagner revisited (Q1301890) (← links)
• Stability analysis and optimization of an inventory system with bounded orders (Q1303712) (← links)
• Average cost optimality in inventory models with Markovian demands (Q1356092) (← links)
• A dynamic analysis of the single-item periodic stochastic inventory system with order capacity (Q1869671) (← links)
• Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming (Q2031075) (← links)
• Constraint programming for computing non-stationary \((R, S)\) inventory policies (Q2482781) (← links)
• New structural properties of inventory models with Polya frequency distributed demand and fixed setup cost (Q2628194) (← links)
• Optimal and near-optimal \((s,S)\) inventory policies for Levy demand processes (Q2765598) (← links)
• On asymptotic approximations for (s,S) policies (Q3026695) (← links)
• (Q3104287) (← links)
• An Overview for Markov Decision Processes in Queues and Networks (Q3305576) (← links)
• Allocation policies and cost approximations for multilocation inventory systems (Q3311984) (← links)
• On Optimal Satisficing: How Simple Policies Can Achieve Excellent Results (Q3542285) (← links)
• A Revision of the Power Approximation for Computing (<i>s</i>, <i>S</i>) Policies (Q3677467) (← links)
• New algorithms for (<i>Q,r</i>) systems with complete backordering using a fill‐rate criterion (Q3724057) (← links)
• Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy (Q3980519) (← links)
• An Efficient Algorithm for Computing an Optimal (r, Q) Policy in Continuous Review Stochastic Inventory Systems (Q4022939) (← links)
• Automatic generation of efficient policy alternatives via simulation-optimization (Q4656747) (← links)
• ERROR ANALYSIS OF AN APPROXIMATE OPTIMAL POLICY FOR AN INVENTORY SYSTEM WITH STOCHASTIC AND CONTINUOUS DEMANDS (Q4904521) (← links)
• Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution (Q5095159) (← links)
• Confidence Intervals for Data-Driven Inventory Policies with Demand Censoring (Q5131460) (← links)
• (Q5715663) (← links)
• A gradient-based method to calculate \((s,S)\) policies (Q6047706) (← links)
• A simple heuristic for computing non-stationary inventory policies based on function approximation (Q6565432) (← links)
• Data-driven inventory control involving fixed setup costs and discrete censored demand (Q6659080) (← links)