Computing optimal () policy parameters by a hybrid of branch-and-bound and stochastic dynamic programming
Open Access
- 1 October 2021
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 294 (1) , 91-99
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Regional Development Fund
- Science Foundation Ireland (12/RC/2289-P2)
This publication has 40 references indexed in Scilit:
- Inventory control for point-of-use locations in hospitalsJournal of the Operational Research Society, 2012
- A state space augmentation algorithm for the replenishment cycle inventory policyInternational Journal of Production Economics, 2011
- Computing the non-stationary replenishment cycle inventory policy under stochastic supplier lead-timesInternational Journal of Production Economics, 2010
- On the empirical performance of (T,s,S) heuristicsEuropean Journal of Operational Research, 2010
- Inventory/distribution control system in a one-warehouse/multi-retailer supply chainInternational Journal of Production Economics, 2008
- A Global Chance-Constraint for Stochastic Inventory Systems Under Service Level ConstraintsConstraints, 2008
- The stochastic dynamic production/inventory lot-sizing problem with service-level constraintsInternational Journal of Production Economics, 2004
- Selecting the best periodic inventory control and demand forecasting methods for low demand itemsJournal of the Operational Research Society, 1997
- POWER APPROXIMATIONS FOR A TWO‐ECHELON INVENTORY SYSTEM USING SERVICE LEVELSProduction and Operations Management, 1995
- Dynamic ProgrammingScience, 1966