ANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY

Authors

  • P. Vijaya Laxmi
  • Veena Goswami KIIT University India Professor & Dean , School of Computer Application,KIIT University, Bhubaneswar
Abstract:

This paper analyzes a controllable discrete-time machine repair problem withL operating machines and two repairmen. The number of working servers can be adjusteddepending on the number of failed machines in the system one at a time at machine's failure orat service completion epochs. Analytical closed-form solutions of the stationary probabilities ofthe number of failed machines in the system are obtained. We develop the total expected costfunction per machine per unit time and obtain the optimal operating policy and the optimalservice rate at minimum cost using quadratic ¯t search method and simulated annealingmethod. Various performance measures along with numerical results to illustrate the in°uenceof various parameters on the bu®er behavior are also presented.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

analysis of discrete-time machine repair problem with two removable servers under triadic policy

this paper analyzes a controllable discrete-time machine repair problem withl operating machines and two repairmen. the number of working servers can be adjusteddepending on the number of failed machines in the system one at a time at machine's failure orat service completion epochs. analytical closed-form solutions of the stationary probabilities ofthe number of failed machines in the sys...

full text

A time-shared machine repair problem with mixed spares under N-policy

The present investigation deals with a machine repair problem consisting of cold and warm standby machines. The machines are subject to breakdown and are repaired by the permanent repairman operating under N-policy. There is provision of one additional removable repairman who is called upon when the work load of failed machines crosses a certain threshold level and is removed as soon as the wor...

full text

Vacation model for Markov machine repair problem with two heterogeneous unreliable servers and threshold recovery

Markov model of multi-component machining system comprising two unreliable heterogeneous servers and mixed type of standby support has been studied. The repair job of broken down machines is done on the basis of bi-level threshold policy for the activation of the servers. The server returns back to render repair job when the pre-specified workload of failed machines is build up. The first (seco...

full text

Optimal Thresholds of an Infinite Buffer Discrete-Time Two-Server System with Triadic Policy

This paper analyzes a discrete-time infinite-buffer Geo/Geo/2 queue, in which the number of servers can be adjusted depending on the number of customers in the system one at a time at arrival or at service completion epoch. Analytical closed-form solutions of the infinite-buffer Geo/Geo/2 queueing system operating under the triadic (0, Q N, M) policy are derived. The total expected cost functio...

full text

Multi server machine repair problem with unreliable server and two types of spares under asynchronous vacation policy

In many industrial situations, machines are subjected to random breakdowns. In this paper, we consider the asynchronous vacation policy for the multi-server machine repair problem with server breakdown and two types of spares. According to this policy, when a certain number of servers become idle at a service completion instant, the servers will take an asynchronous vacation of random length to...

full text

Discrete-Time Approximation of the Machine Interference Problem with Generally Distributed Failure, Repair, and Walking Times

In this paper we present an approximate discrete time analysis of the machine interference problem with generally distributed working failure and walking times We analyze the corresponding asymmetric polling system consisting of N separate closed queuing stations bu er and server each of which contains a single customer These queuing stations are attended to by a common server in a cyclic manne...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 5  issue 1 (WINTER)

pages  29- 40

publication date 2015-03-21

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023