Paper Info
Title
Strategies for a Centralized Single Product Multiclass M/G/1 Make-to-Stock Queue
Abstract
Make-to-stock queues are typically investigated in the M/M/1 settings. For centralized single-item systems with backlogs, the multilevel rationing (MR) policy is established as optimal and the strict priority (SP) policy is a practical compromise, balancing cost and ease of implementation. However, the optimal policy is unknown when service time is general, i.e., for M/G/1 queues. Dynamic programming, the tool commonly used to investigate the MR policy in make-to-stock queues, is less practical when service time is general. In this paper we focus on customer composition: the proportion of customers of each class to the total number of customers in the queue. We do so because the number of customers in M/G/1 queues is invariant for any nonidling and nonanticipating policy. To characterize customer composition, we consider a series of two-priority M/G/1 queues where the first service time in each busy period is different from standard service times, i.e., this first service time is exceptional. We characterize the required exceptional first service times and the exact solution of such queues. From our results, we derive the optimal cost and control for the MR and SP policies for M/G/1 make-to-stock queues.
Year
DOI
Venue
2012
10.1287/opre.1120.1062
Operations Research
Keywords
Field
DocType
sp policy,mr policy,centralized single product multiclass,optimal cost,nonanticipating policy,make-to-stock queue,two-priority m,customer composition,service time,optimal policy,standard service time,make to stock,m g 1 queue
Dynamic programming,Mathematical optimization,M/G/1 queue,Queue,M/G/k queue,Queueing theory,Fork–join queue,M/M/∞ queue,Build to stock,Operations management,Mathematics
Journal
Volume
Issue
ISSN
60
4
0030-364X
Citations 
PageRank 
References 
5
0.69
8
Authors
3
Name
Order
Citations
PageRank
Hossein Abouee-Mehrizi1355.52
Baris Balcioglu2727.57
Opher Baron314514.64