期刊
APPLIED MATHEMATICAL MODELLING
卷 38, 期 21-22, 页码 5113-5125出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.apm.2014.03.012
关键词
Optimization; (p, N)-policy; Server breakdowns; Tabu search; Single vacation
资金
- National Science Council of Republic of China [NSC 100-2221-E-025-005-MY3, NSC 102-2221-E-141-003-]
This paper deals with the (p, N)-policy M/G/1 queue with an unreliable server and single vacation. Immediately after all of the customers in the system are served, the server takes single vacation. As soon as N customers are accumulated in the queue, the server is activated for services with probability p or deactivated with probability (1 - p). When the server returns from vacation and the system size exceeds N, the server begins serving the waiting customers. If the number of customers waiting in the queue is less than N when the server returns from vacation, he waits in the system until the system size reaches or exceeds N. It is assumed that the server is subject to break down according to a Poisson process and the repair time obeys a general distribution. This paper derived the system size distribution for the system described above at a stationary point of time. Various system characteristics were also developed. We then constructed a total expected cost function per unit time and applied the Tabu search method to find the minimum cost. Some numerical results are also given for illustrative purposes. (C) 2014 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据