Strategies for a centralized single product multiclass M/G/1 make-to-stock queue

Warning The system is temporarily closed to updates for reporting purpose.

Abouee-Mehrizi, Hossein and Balcıoğlu, Ahmet Barış and Baron, Opher (2012) Strategies for a centralized single product multiclass M/G/1 make-to-stock queue. Operations Research, 60 (4). pp. 803-812. ISSN 0030-364X

PDF (This is a RoMEO green journal -- author can archive pre-print (ie pre-refereeing)) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

Official URL: http://dx.doi.org/10.1287/opre.1120.1062


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.

Item Type:Article
Subjects:Q Science > Q Science (General)
ID Code:19398
Deposited By:Barış Balcıoğlu
Deposited On:16 Oct 2012 15:12
Last Modified:31 Jul 2019 11:31

Repository Staff Only: item control page