𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An optimal maintenance policy for a server with decreasing arrival rate

✍ Scribed by J Koyanagi; H Kawai


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
633 KB
Volume
31
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

✦ Synopsis


study an optimal maintenance policy for the server in a queueing system. Customers arrive at the server in a Poisson stream and are served by an exponential server, which is subject to multiple states indicating levels of popularity. The server state transitions are governed by a Markov process. The arrival rate depends on the server state and it decreases as the server loses popularity. By maintenance the server state recovers completely, though the customers in the system are lost at the beginning of maintenance. The customers who arrive during maintenance are also lost. In this paper, two kinds of such systems are considered. The first system receives a unit reward when a customer arrives at the system and pays a unit cost for each lost customer at the start of maintenance. The second system receives a unit reward at departure, and pays nothing for lost customers at the beginning of maintenance. Our objective is to maximize the total expected discounted profit over an infinite time horizon. We use a semi-Markov decision process to formulate the problem and are able to establish some properties for the optimal maintenance policy under certain conditions.


πŸ“œ SIMILAR VOLUMES


An optimal maintenance policy for a syst
✍ J.H Seo; D.S Bai πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 455 KB

A preventive maintenance policy with minimal repair at failure, periodic overhaul, and replacement is considered. A model describing the effect of overhaul is proposed and the expected cost rate is obtained under negligible or nonnegligible maintenance time. Based on this model, optimal number of ov

Maximum entropy approach for batch-arriv
✍ Jau-Chuan Ke; Chuen-Horng Lin πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 342 KB

We consider the M [x] /G/1 queueing system, in which the server operates N policy and a single vacation. As soon as the system becomes empty the server leaves for a vacation of random length V . When he returns from the vacation and the system size is greater than or equal to a threshold value N , h