Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Dynamic scheduling of a multiclass make-to-stock queue
Operations Research
Dynamic Programming and Optimal Control, Two Volume Set
Dynamic Programming and Optimal Control, Two Volume Set
Assessing the Benefits of Different Stock-Allocation Policies for a Make-to-Stock Production System
Manufacturing & Service Operations Management
Stock Rationing in an M/Ek/1 Make-to-Stock Queue
Management Science
Optimal Policies for Inventory Systems with Priority Demand Classes
Operations Research
On the Benefits of Pooling in Production-Inventory Systems
Management Science
Computers and Operations Research
Optimal Control Of A Make-To-Stock System With Adjustable Service Rate
Probability in the Engineering and Informational Sciences
Manufacturing & Service Operations Management
Effects of system parameters on the optimal policy structure in a class of queueing control problems
Queueing Systems: Theory and Applications
Dynamic Capacity Management with Substitution
Operations Research
Capacity Rationing in Stochastic Rental Systems with Advance Demand Information
Operations Research
Critical level policies in lost sales inventory systems with different demand classes
EPEW'11 Proceedings of the 8th European conference on Computer Performance Engineering
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
A two-demand-class inventory system with lost-sales and backorders
Operations Research Letters
Strategies for a Centralized Single Product Multiclass M/G/1 Make-to-Stock Queue
Operations Research
A study on coordination of capacity allocation for different types of contractual retailers
Decision Support Systems
Stochastic models for the coordinated production and shipment problem in a supply chain
Computers and Industrial Engineering
Anticipated rationing policy for two demand classes under service level constraints
Computers and Industrial Engineering
| Hi-index | 0.01 |
We consider a capacitated supply system that produces a single item that is demanded by several classes of customers. Each customer class may have a different backorder cost, so stock allocation arises as a key decision problem. We model the supply system as a multi customer make-to-stock queue. Using dynamic programming, we show that the optimal allocation policy has a simple and intuitive structure. In addition, we present an efficient algorithm to compute the parameters of this optimal allocation policy. Finally, for a typical supply chain design problem, we illustrate that ignoring the stock allocation dimension--a frequently encountered simplifying assumption--can lead to incorrect managerial decisions.