Please use this identifier to cite or link to this item: https://doi.org/10.1007/s00291-011-0239-2
Title: Dynamic rationing and ordering policies for multiple demand classes
Authors: Chew, E.P. 
Lee, L.H. 
Liu, S.
Keywords: Demand classes
Dynamic programming
Dynamic rationing policy
Periodic review policy
Issue Date: 2013
Source: Chew, E.P., Lee, L.H., Liu, S. (2013). Dynamic rationing and ordering policies for multiple demand classes. OR Spectrum 35 (1) : 127-151. ScholarBank@NUS Repository. https://doi.org/10.1007/s00291-011-0239-2
Abstract: In this paper, we study the dynamic rationing problem for multiple demand classes with Poisson demands. We first consider a multi-period problem with zero lead time and show that the optimal rationing and ordering policies are, respectively, the dynamic rationing policy and the base stock policy. We then extend this model to a non-zero lead time and show that there is no simple optimal structure for this extended problem. A myopic policy and a lower bound are proposed. The numerical results show that the dynamic rationing policy outperforms the static rationing policy and its performance is very close to the optimal policy under a wide range of operating conditions. © 2011 Springer-Verlag.
Source Title: OR Spectrum
URI: http://scholarbank.nus.edu.sg/handle/10635/63106
ISSN: 01716468
DOI: 10.1007/s00291-011-0239-2
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

11
checked on Dec 7, 2017

WEB OF SCIENCETM
Citations

8
checked on Nov 23, 2017

Page view(s)

24
checked on Dec 11, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.