OPTIMAL MAINTENANCE AND OPERATION OF A SYSTEM WITH BACKUP COMPONENTS

2002 ◽  
Vol 16 (3) ◽  
pp. 339-349 ◽  
Author(s):  
Rhonda Righter
Keyword(s):  
Failure Rate ◽  
Closed System ◽  
Optimal Policy ◽  
Idle Time ◽  
Repair Time ◽  
Single Server ◽  
System Availability ◽  
Turn On ◽  
Single Server Queues ◽  
Optimal Maintenance

We consider a system with heterogeneous unreliable components that requires only one component to be turned on in order for it to operate. Repair workers may have different skills and may be unavailable for random periods of time. The problem is to determine a usage and repair policy to maximize system availability. We give conditions under which the optimal usage policy is to always use, or turn on, the component with the shortest repair time, and the optimal repair policy is to always repair the most reliable component (with the smallest failure rate). We fully characterize the optimal policy when there are only two components. Our system is equivalent to a closed system with multiple single-server queues, where the objective is to minimize server idle time at one of the queues.

Optimal policies for machine repairmen problems

1993 ◽  
Vol 30 (3) ◽  
pp. 703-715 ◽  
Author(s):  
Esther Frostig
Keyword(s):  
Failure Rate ◽  
Optimal Policy ◽  
Repair Time ◽  
Increasing Failure Rate ◽  
Rate Distribution ◽  
Unreliable Machines ◽  
Optimal Policies

n unreliable machines are maintained by m repairmen. Assuming exponentially distributed up-time and repair time we find the optimal policy to allocate the repairmen to the failed machines in order to stochastically minimize the time until all machines work. Considering only one repairman, we find the optimal policy to maximize the expected total discount time that machines work. We find the optimal policy for the cases where the up-time and repair time are exponentially distributed or identically arbitrarily distributed up-times and increasing failure rate distribution repair times.

Optimal policies for machine repairmen problems

1993 ◽  
Vol 30 (03) ◽  
pp. 703-715 ◽  
Author(s):  
Esther Frostig
Keyword(s):  
Failure Rate ◽  
Optimal Policy ◽  
Repair Time ◽  
Increasing Failure Rate ◽  
Rate Distribution ◽  
Unreliable Machines ◽  
Optimal Policies

n unreliable machines are maintained by m repairmen. Assuming exponentially distributed up-time and repair time we find the optimal policy to allocate the repairmen to the failed machines in order to stochastically minimize the time until all machines work. Considering only one repairman, we find the optimal policy to maximize the expected total discount time that machines work. We find the optimal policy for the cases where the up-time and repair time are exponentially distributed or identically arbitrarily distributed up-times and increasing failure rate distribution repair times.

Markov-Based Maintenance Planning Considering Repair Time and Periodic Inspection

2013 ◽  
Vol 135 (3) ◽  
Author(s):  
Seungchul Lee ◽  
Lin Li ◽  
Jun Ni
Keyword(s):  
Markov Process ◽  
Numerical Study ◽  
Repair Time ◽  
Phase Type Distribution ◽  
Adequate Model ◽  
System Availability ◽  
Periodic Inspection ◽  
Optimal Maintenance ◽  
Maintenance Policies ◽  
Machine Systems

The equipment degradation and various maintenance decision processes with unreliable machines have been studied extensively. The traditional degradation modeling using Markov process only focuses on single machine system and ignores maintenance or repair duration. This paper is devoted to analytical and numerical study of production lines within the Markov process framework considering repair time and periodic inspection. Nonexponential holding time distributions in Markov chain are approximated by inserting multiple intermediate states based on a phase-type distribution. Overall system availability is calculated by recursively solving the balance equations of the Markov process. The results show that the optimal inspection intervals for two repairable-machine systems can be achieved by means of the proposed method. By having an adequate model representing both deterioration and maintenance processes, it is also possible to obtain different optimal maintenance policies to maximize the availability or productivity for different configurations of components.

scholarly journals BOUNDS AND AN APPROXIMATION FOR SINGLE SERVER QUEUES

1983 ◽  
Vol 26 (2) ◽  
pp. 118-134 ◽  
Author(s):  
Jeyaveerasingam George Shanthikumar
Keyword(s):  
Single Server ◽  
Single Server Queues

scholarly journals Weak Convergence Limits for Closed Cyclic Networks of Queues with Multiple Bottleneck Nodes

2012 ◽  
Vol 49 (1) ◽  
pp. 60-83
Author(s):  
Ole Stenzel ◽  
Hans Daduna
Keyword(s):  
Central Limit Theorem ◽  
Limit Theorem ◽  
Time Distribution ◽  
Idle Time ◽  
Single Server ◽  
Sojourn Time Distribution ◽  
Cyclic Networks ◽  
Number Of Customers ◽  
Networks Of Queues ◽  
Asymptotic Behaviours

We consider a sequence of cycles of exponential single-server nodes, where the number of nodes is fixed and the number of customers grows unboundedly. We prove a central limit theorem for the cycle time distribution. We investigate the idle time structure of the bottleneck nodes and the joint sojourn time distribution that a test customer observes at the nonbottleneck nodes during a cycle. Furthermore, we study the filling behaviour of the bottleneck nodes, and show that the single bottleneck and multiple bottleneck cases lead to different asymptotic behaviours.

Sign in / Sign up

Export Citation Format

Share Document