Reliability analysis and selective maintenance for multistate queueing system

2021 ◽  
pp. 1748006X2110343
Author(s):  
Tang Tang ◽  
Lijuan Jia ◽  
Jin Hu ◽  
Yue Wang ◽  
Cheng Ma
Keyword(s):  
Queueing System ◽  
Operation Time ◽  
State System ◽  
Profit Rate ◽  
Time Service ◽  
Queueing Process ◽  
System A ◽  
Binary State ◽  
Deterioration Process ◽  
Selective Maintenance

The reliability theory of the multi-state system (MSS) has received considerable attention in recent years, as it is able to characterize the multi-state property and complicated deterioration process of systems in a finer way than that of binary-state system. In general, the performance of the task processing type MSS is typically measured by an operation time (processing speed). Whereas, considering the queueing phenomenon caused by the random arrival and processing of tasks, some other criteria should be taken into account to evaluate the quality of service (QoS) and the profit of stakeholders, such as waiting time, service and abandon rate of tasks and consequent profit rate. In this article, we focus on the queueing process of tasks and analyse the performance and reliability of MSS in an M/M/2 queueing model, which is referred to as a multi-state queueing system (MSQS). Two kinds of deterioration are studied including the gradual degradation of servers and the sudden breakdown of the whole system. A performance assessment function is defined to obtain the profit rate of MSQS in different performance states. Based on the proposed performance function, the selective maintenance method is studied to optimize the accumulated profit under the constraint of maintenance resource and time.

scholarly journals Automatic Course Scheduling System in Universities Based on Hybrid Genetic-Ant Colony Algorithm

2021 ◽  
Vol 2066 (1) ◽  
pp. 012079
Author(s):  
Yanbei Duan ◽  
Wenjie Lu
Keyword(s):  
Hybrid Algorithm ◽  
Ant Colony Algorithm ◽  
Operation Time ◽  
Original System ◽  
Colleges And Universities ◽  
Ant Colony ◽  
Scheduling System ◽  
Course Scheduling ◽  
System A ◽  
New System

Abstract Scheduling is the daily work of the Ministry of Education in Colleges and universities. In the past ten years, the scale of our colleges and universities has expanded rapidly, but the teaching resources are relatively limited. Many schools are facing the problem of insufficient classroom resources and teachers resources. The current way of organizing courses is increasingly difficult to make full use of existing resources to solve the changing needs and inefficiencies, which need to be improved urgently. This paper applies the hybrid Genetic-Ant algorithm to the automatic course scheduling system in Colleges and universities, and uses the cross-function to design and build the automatic course scheduling system in Colleges and universities. And select a college’s course scheduling system from this city for research, and use the Genetic-Ant hybrid algorithm to improve the original system to form a new system, called the original system A, and called the improved new system B, to compare the operation time and system suitability of the two systems. The results show that the fitness of system B is better than that of system A. When the scheduling unit is 100, the fitness of system A is 181, and system B is 203. When the scheduling unit is 400, the fitness of system B is 14 higher than that of system A. When the scheduling unit is 800, the fitness of system B is 64 higher than that of system A. Thus, the hybrid algorithm of genetic ant colony can improve the rationality of the curriculum.

scholarly journals M/G/1 vacation model with limited service discipline and hybrid switching-on policy

1997 ◽  
Vol 3 (3) ◽  
pp. 243-253
Author(s):  
Alexander V. Babitsky
Keyword(s):  
Generating Function ◽  
Busy Period ◽  
Optimization Problem ◽  
Queueing System ◽  
Service Discipline ◽  
Multiple Vacations ◽  
Queueing Process ◽  
Vacation Model ◽  
Hybrid Switching ◽  
Limited Service

The author studies an M/G/1 queueing system with multiple vacations. The server is turned off in accordance with the K-limited discipline, and is turned on in accordance with the T-N-hybrid policy. This is to say that the server will begin a vacation from the system if either the queue is empty orKcustomers were served during a busy period. The server idles until it finds at leastNwaiting units upon return from a vacation.Formulas for the distribution generating function and some characteristics of the queueing process are derived. An optimization problem is discussed.

Capital and the state system: a class act

2007 ◽  
Vol 20 (4) ◽  
pp. 619-637 ◽  
Author(s):  
Kees van der Pijl
Keyword(s):  
The State ◽  
State System ◽  
System A

The GI/G/1 queue with uniformly limited virtual waiting times; the finite dam

1980 ◽  
Vol 12 (2) ◽  
pp. 501-516 ◽  
Author(s):  
Do Le Minh
Keyword(s):  
Water Supply ◽  
Analytical Method ◽  
Busy Period ◽  
Queueing System ◽  
Waiting Times ◽  
Fixed Interval ◽  
Finite Capacity ◽  
Queueing Process ◽  
Finite Dam

This paper studies the GI/G/1 queueing system in which no customer can stay longer than a fixed interval D. This is also a model for the dam with finite capacity, instantaneous water supply and constant release rule. Using analytical method together with the property that the queueing process ‘starts anew’ probabilistically whenever an arriving customer initiates a busy period, we obtain various transient and stationary results for the system.

scholarly journals A bulk queueing system under N-policy with bilevel service delay discipline and start-up time

1993 ◽  
Vol 6 (4) ◽  
pp. 359-384 ◽  
Author(s):  
David C. R. Muh
Keyword(s):  
Queue Length ◽  
Queueing System ◽  
Probability Generating Function ◽  
Single Server ◽  
Numerical Examples ◽  
Queueing Process ◽  
Poisson Input ◽  
Service Delay ◽  
Start Up ◽  
Bulk Arrival

The author studies the queueing process in a single-server, bulk arrival and batch service queueing system with a compound Poisson input, bilevel service delay discipline, start-up time, and a fixed accumulation level with control operating policy. It is assumed that when the queue length falls below a predefined level r(≥1), the system, with server capacity R, immediately stops service until the queue length reaches or exceeds the second predefined accumulation level N(≥r). Two cases, with N≤R and N≥R, are studied.The author finds explicitly the probability generating function of the stationary distribution of the queueing process and gives numerical examples.

Sign in / Sign up

Export Citation Format

Share Document