2004
DOI: 10.1080/16843703.2004.11673079
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Management of a Removable and Non-Reliable Server in an Infinite and a Finite M/Hk/1 Queueing System

Abstract: We consider a single removable and non-reliable server in both infinite capacity and finite capacity queueing systems with Poisson arrivals and k-type hyper-exponential distribution for the service times operating under the N policy. The server may be turned on at arrival epochs or off at departure epochs. Breakdown and repair times of the server are assumed to follow a negative exponential distribution. Cost model for infinite capacity queueing system (say cost model 1) is developed to determine the optimal o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2005
2005
2022
2022

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 37 publications
(17 citation statements)
references
References 15 publications
0
17
0
Order By: Relevance
“…Later, Wang and Ke [15] investigated three control policies in an M/G/1 queueing system and proved that in three control policies, the probability that the server is busy in the steady-state is equal to the traffic intensity. Recently, Wang et al [16] extended Wang and YenÕs system [11] to unreliable server case.…”
Section: Queueing Systems Under N Policymentioning
confidence: 99%
“…Later, Wang and Ke [15] investigated three control policies in an M/G/1 queueing system and proved that in three control policies, the probability that the server is busy in the steady-state is equal to the traffic intensity. Recently, Wang et al [16] extended Wang and YenÕs system [11] to unreliable server case.…”
Section: Queueing Systems Under N Policymentioning
confidence: 99%
“…The system can handle only one job at a time-and the system resumes as soon as the interruption ends. The arrival rate, service rate, breakdown rate and repair rate are fuzzy numbers represented by [10,20,30,40] The manager of the system wants to know the system characteristic such as how many hours the processing system is idle. By continuing in a similar manner explained in Example 1, we have fig.…”
Section: Examplementioning
confidence: 99%
“…His system was extended to the GI/G/I case by Sengupta [8]. Li et al [6] and Wang [10] investigated the behaviour of the unreliable server, and the effect the server breakdowns and repairs in the M/G/I queuing models and he investigated the controllable M/H K /I queuing systems with an unreliable server recently.…”
Section: Introductionmentioning
confidence: 99%
“…The first ordinary M/G/I queuing system which has interrupted services and priorities was first proposed by Gaver [1]. Then Sengupta [2] extended the system proposed by Gaver [1] to the GI/G/I case. The behavior of the of the unreliable server and the impact of the unreliable server on the server breakdowns and repairs of the M/G/I queuing models was first established by the Li [3] and Wang [4].…”
Section: Introductionmentioning
confidence: 99%