Differentiated service inventory optimization using nested partitions and MOCBA
Computers and Operations Research
Manufacturing & Service Operations Management
Dynamic Capacity Management with Substitution
Operations Research
Capacity Rationing in Stochastic Rental Systems with Advance Demand Information
Operations Research
No-Holdback Allocation Rules for Continuous-Time Assemble-to-Order Systems
Operations Research
Achieving a Long-Term Service Target with Periodic Demand Signals: A Newsvendor Framework
Manufacturing & Service Operations Management
A Periodic-Review Base-Stock Inventory System with Sales Rejection
Operations Research
An (s,Q) Markovian inventory system with lost sales and two demand classes
Mathematical and Computer Modelling: An International Journal
In-Season Transshipments Among Competitive Retailers
Manufacturing & Service Operations Management
An embedded Markov chain approach to stock rationing
Operations Research Letters
Policies utilizing tactical inventory for service-differentiated customers
Operations Research Letters
Cost optimization in the (S-1,S) lost sales inventory model with multiple demand classes
Operations Research Letters
Optimal production and rationing decisions in supply chains with information sharing
Operations Research Letters
Anticipated rationing policy for two demand classes under service level constraints
Computers and Industrial Engineering
Queuing system for different classes of customers
International Journal of Business Information Systems
A possibilistic multiple objective pricing and lot-sizing model with multiple demand classes
Fuzzy Sets and Systems
Computers and Operations Research
Hi-index | 0.01 |
Motivated by a study of the logistics systems used to manage consumable service parts for the U.S. military, we consider a static threshold-based rationing policy that is useful when pooling inventory across two demand classes characterized by different arrival rates and shortage (stockout and delay) costs. The scheme operates as a ( Q, r) policy with the following feature. Demands from both classes are filled on a first-come-first-serve basis as long as on-hand inventory lies above a threshold levelK. Once on-hand inventory falls below this level, low-priority (i.e., low shortage cost) demand is backordered while high-priority demand continues to be filled. We analyze this static policy first under the assumption that backorders are filled according to a special threshold clearing mechanism. Structural results for the key performance measures are established to enable an efficient solution algorithm for computing stock control and rationing parameters (i.e.,Q, r, andK). Numerical results confirm that the solution under this special threshold clearing mechanism closely approximates that of the priority clearing policy. We next highlight conditions where our policy offers significant savings over traditional "round-up" and "separate stock" policies encountered in the military and elsewhere. Finally, we develop a lower bound on the cost of the optimal rationing policy. Numerical results show that the performance gap between our static threshold policy and the optimal policy is small in environments typical of the military and high-technology industries.