نتایج جستجو برای: Threshold policy . Vacation . Machine repair . Cost optimization . Runge

تعداد نتایج: 1381085  

2013
Ching-Ho Yen

We consider a machine repair problem with server breakdowns, in which an unreliable server (repairman) operates the threshold recovery policy. When there are no failed machines in the system, the server leaves for a vacation. If the server returns from a vacation to find no failed machines in the system, he/she immediately takes another vacation. And the server continues in this manner until he...

Madhu Jain Rakesh Kumar Meena

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...

This paper deals with bi-level control policy and queuing analysis of a machine repair problem. The model is developed by incorporating mixed standbys (cold and warm), reneging, set up and vacation time. The repair facility consists of two heterogeneous repairmen in the system. The life and repair time of the failed units and also their set up times are assumed to be exponentially distributed. ...

1993
Eitan ALTMAN

We consider a M/G/1 queue where the server may take repeated vacations. Whenever a busy period terminates the server takes a vacation of random duration. At the end of each vacation the server may either take a new vacation or resume service; if the queue is found empty the server always takes a new vacation. The cost structure includes a holding cost per unit of time and per customer in the sy...

2005
Jau-CHUAN KE

This paper studies the N policy M/G/1 queue with server vacations; startup and breakdowns, where arrivals form a compound Poisson process and service times are generally distributed. The server is turned off and takes a vacation whenever the system is empty. If the number of customers waiting in the system at the instant of a vacation completion is less than N, the server will take another vaca...

2014
Madhu Jain Chandra Shekhar Shalini Shukla

In this investigation, we study the performance characteristics of (m,M) machining systems having warm spares and two heterogeneous servers. The first server is permanent and available full time in the system, whereas the second server takes vacation according to the specific threshold policy. In some real time systems, spares may or may not replace/switch in the system whenever an operating un...

In this paper, we presented an optimal iterative decision rule for minimizing total cost in designing a sampling plan for machine replacement problem using the approach of dynamic programming and Bayesian inferences. Cost of replacing the machine and cost of defectives produced by machine has been considered in model. Concept of control threshold policy has been applied for decision making. If ...

Journal: :European Journal of Operational Research 2006
Naishuo Tian Zhe George Zhang

We consider a queueing system with c servers and a threshold type vacation policy. In this system, when a certain number d<c of servers become idle at a service completion instant, these d servers will take a synchronous vacation of random length together. After each vacation, the number of customers in the system is checked. If that number is N or more, these d servers will resume serving the ...

Chandra Shekhar Madhu Jain Shalini Shukla

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...

Journal: :RAIRO - Operations Research 2009
Jau-Chuan Ke Ssu-Lang Lee Cheng-Hwai Liou

This paper studies the machine repair problem consisting of M operating machines with S spare machines, and R servers (repairmen) who leave for a vacation of random length when there are no failed machines queuing up for repair in the repair facility. At the end of the vacation the servers return to the repair facility and operate one of three vacation policies: single vacation, multiple vacati...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید