On computing optimal \((Q,r)\) replenishment policies under quantity discounts

From MaRDI portal
Revision as of 16:22, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1931664


DOI10.1007/s10479-012-1071-zzbMath1254.90020MaRDI QIDQ1931664

Michael N. Katehakis, Laurens C. Smit

Publication date: 15 January 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1071-z


90B05: Inventory, storage, reservoirs


Related Items

Inventory control with modulated demand and a partially observed modulation process, An optimal \((r,Q)\) policy in a stochastic inventory system with all-units quantity discount and limited sharable resource, A make-to-stock production/inventory model with MAP arrivals and phase-type demands, Analysis of inventory policies for perishable items with fixed leadtimes and lifetimes, On optimal bidding and inventory control in sequential procurement auctions: the multi period case, Quantifying sustainable control of inventory systems with non-linear backorder costs, Inventory systems with stochastic and batch demand: computational approaches, Inventory turns and finite-horizon Little's laws, Service with a queue and a random capacity cart: random processing batches and E-limited policies, Dynamic procurement from multiple suppliers with random capacities, On the optimality equation for average cost Markov decision processes and its validity for inventory control, The ``sensitive Markovian queueing system and its application for a call center problem, Optimal replenishment rate for inventory systems with compound Poisson demands and lost sales: a direct treatment of time-average cost, Online ordering rules for the multi-period newsvendor problem with quantity discounts, A road map to new product success: warranty, advertisement and price, A comparative analysis of the successive lumping and the lattice path counting algorithms, An (s, k, S) fluid inventory model with exponential leadtimes and order cancellations



Cites Work