Shared storage policies based on the duration stay of unit loads
Management Science
Robust Solutions to Least-Squares Problems with Uncertain Data
SIAM Journal on Matrix Analysis and Applications
Mathematics of Operations Research
Robust Solutions to Uncertain Semidefinite Programs
SIAM Journal on Optimization
Operations Research
Adjustable robust solutions of uncertain linear programs
Mathematical Programming: Series A and B
Ambiguous chance constrained problems and robust optimization
Mathematical Programming: Series A and B
A Robust Optimization Approach to Dynamic Pricing and Inventory Control with no Backorders
Mathematical Programming: Series A and B
Retailer-Supplier Flexible Commitments Contracts: A Robust Optimization Approach
Manufacturing & Service Operations Management
A Robust Optimization Approach to Inventory Theory
Operations Research
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Operations Research
A Linear Decision-Based Approximation Approach to Stochastic Programming
Operations Research
Operations Research
Robust Optimization for Empty Repositioning Problems
Operations Research
Robust Approximation to Multiperiod Inventory Management
Operations Research
Optimality of Affine Policies in Multistage Robust Optimization
Mathematics of Operations Research
Distributionally Robust Optimization and Its Tractable Approximations
Operations Research
Robust Optimization Made Easy with ROME
Operations Research
Robust solutions of uncertain linear programs
Operations Research Letters
Robust linear optimization under general norms
Operations Research Letters
| Hi-index | 0.01 |
Assigning products to and retrieving them from proper storage locations are crucial decisions in minimizing the operating cost of a unit-load warehouse. The problem becomes intractable when the warehouse faces variable supply and uncertain demand in a multiperiod setting. We assume a factor-based demand model in which demand for each product in each period is affinely dependent on some uncertain factors. The distributions of these factors are only partially characterized. We introduce a robust optimization model that minimizes the worst-case expected total travel in the warehouse with distributional ambiguity of demand. Under a linear decision rule, we obtain a storage and retrieval policy by solving a moderate-size linear optimization problem. Surprisingly, despite imprecise specification of demand distributions, our computational studies suggest that the linear policy achieves close to the expected value given perfect information and significantly outperforms existing heuristics in the literature. This paper was accepted by Gérard P. Cachon, optimization.