Computing non-stationary \((s, S)\) policies using mixed integer linear programming
From MaRDI portal
Publication:724127
DOI10.1016/j.ejor.2018.05.030zbMath1403.90063arXiv1702.08820OpenAlexW2593990685WikidataQ57539163 ScholiaQ57539163MaRDI QIDQ724127
Roberto Rossi, S. Armagan Tarim, Mengyuan Xiang, Belén Martín-Barragán
Publication date: 25 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.08820
Related Items
On the stochastic inventory problem under order capacity constraints, Stochastic dynamic programming heuristic for the \((R,s,S)\) policy parameters computation, Computing optimal \((R, s, S)\) policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming, Approximations for non-stationary stochastic lot-sizing under \((s,Q)\)-type policy
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Modelling and computing \((R^{n}, S^{n})\) policies for inventory systems with non-stationary stochastic demand
- Piecewise linear lower and upper bounds for the standard normal first order loss function
- Optimizing (\(s, S\)) policies for multi-period inventory models with demand distribution uncertainty: robust dynamic programing approaches
- On handling indicator constraints in mixed integer programming
- (s, S) Inventory Systems with Correlated Demands
- An Efficient Algorithm for Computing Optimal (s, S) Policies
- Optimal Policies for Multiechelon Inventory Problems with Markov-Modulated Demand
- Strategies for the Probabilistic Lot-Sizing Problem with Service-Level Constraints
- On the Objective Function Behavior in (s, S) Inventory Models
- Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy
- Optimality of Myopic Inventory Policies for Certain Dependent Demand Processes
- Cost Models for Stochastic Clearing Systems
- (s, S) Policies Under Continuous Review and Discrete Compound Poisson Demand
- Optimality of (s, S) Policies in Inventory Models with Markovian Demand
- A Simple Heuristic for Computing Nonstationary (s, S) Policies
- Computing Optimal (s, S) Inventory Policies