Profit Analysis of the <Emphasis Type="Italic">M/M/R</Emphasis> Machine Repair Problem with Spares and Server Breakdowns

This paper studies the machine-repair problem consisting of M operating machines with S spares, and R servers which themselves are subject to breakdown under steady-state conditions. Spares are considered to be either cold-standby, or warm-standby or hot-standby. Failure and service times of the machines, and breakdown and repair times of the servers, are assumed to follow a negative exponential distribution. Each server is subject to breakdown even if no failed machines are in the system. A profit model is developed in order to determine the optimal values of the number of servers and spares. Numerical results are provided in which several system characteristics are evaluated for all cases under the optimal operating conditions.     

Analysis of the M1,M2/G/1 G-queueing system with retrial customers

We consider a single server retrial queue with waiting places in service area and three classes of customers subject to the server breakdowns and repairs. When the server is unavailable, the arriving class-1 customer is queued in the priority queue with infinite capacity whereas class-2 customer enters the retrial group. The class-3 customers which are also called negative customers do not receive service. If the server is found serving a customer, the arriving class-3 customer breaks the server down and simultaneously deletes the customer under service. The failed server is sent to repair immediately and after repair it is assumed as good as new. We study the ergodicity of the embedded Markov chains and their stationary distributions. We obtain the steady-state solutions for both queueing measures and reliability quantities. Moreover, we investigate the stochastic decomposition law, the busy period of the system and the virtual waiting times. Finally, an application to cellular mobile networks is provided and the effects of various parameters on the system performance are analyzed numerically.     

Optimal control of a removable and non-reliable server in an infinite and a finite M/H2/1 queueing system

This paper deals with a single removable and non-reliable server in both an infinite and a finite queueing system with Poisson arrivals and two-type hyper-exponential distribution for the service times. The server may be turned on at arrival epochs or off at service completion epochs. Breakdown and repair times of the server are assumed to follow a negative exponential distribution. Conditions for a stable queueing system, that is steady-state, are provided. Cost models for both system capacities are respectively developed to determine the optimal operating policy numerically at minimum cost. This paper provides the minimum expected cost and the optimal operating policy based on assumed numerical values given to the system parameters, as well as to the cost elements. Sensitivity analysis is also investigated.     

Optimal control of a removable and non-reliable server in an M/M/1 queueing system with exponential startup time

We study a single removable and non-reliable server in the N policy M/M/1 queueing system. The server begins service only when the number of customers in the system reaches N (N1). After each idle period, the startup times of the server follow the negative exponential distribution. While the server is working, it is subject to breakdowns according to a Poisson process. When the server breaks down, it requires repair at a repair facility, where the repair times follow the negative exponential distribution. The steady-state results are derived and it is shown that the probability that the server is busy is equal to the traffic intensity. Cost model is developed to determine the optimal operating N policy at minimum cost.     

带有N策略,启动时间和服务台故障的M/M/1排队的均衡策略

本文考虑带有N策略,启动时间和服务台故障的M/M/1排队的顾客的策略行为.当系统为空时服务台关闭,并且只有当系统中的顾客数达到一个给定的阈值时才会被激活,启动时间服从指数分布.服务台在工作时可能会故障,一旦发生故障,它立即被维修,维修的时间服从指数分布.我们得到了不同状态的均衡到达率并且给出了均衡社会收益函数.最后对均衡到达率和均衡社会收益进行了数值研究.     

Cost Analysis of the <Emphasis Type="Italic">M/M/R</Emphasis> Machine Repair Problem with Spares and Two Modes of Failure

In this paper we deal with the machine repair problem consisting of M operating machines with S spare machines, and R repairmen where machines have two failure modes under steady-state conditions. Spares are considered to be either cold-standby, warm-standby or hot-standby. The two failure modes have equal probability of repair. Failure time of the machines and repair time of the repairmen are assumed to follow a negative exponential distribution. A cost model is developed in order to determine the optimal values of the number of repairmen and the number of spares simultaneously, while maintaining a minimum specified level of system availability. Numerical results are presented in which several system characteristics are evaluated for three types of standby under optimal operating conditions.     

Optimal control of the N policy M/G/1 queueing system with server breakdowns and general startup times

This paper deals with an N policy M/G/1 queueing system with a single removable and unreliable server whose arrivals form a Poisson process. Service times, repair times, and startup times are assumed to be generally distributed. When the queue length reaches N(N ? 1), the server is immediately turned on but is temporarily unavailable to serve the waiting customers. The server needs a startup time before providing service until there are no customers in the system. We analyze various system performance measures and investigate some designated known expected cost function per unit time to determine the optimal threshold N at a minimum cost. Sensitivity analysis is also studied.     

The BMAP/PH/N retrial queue with Markovian flow of breakdowns

We consider a multi-server retrial queue with the Batch Markovian Arrival Process (BMAP). The servers are identical and independent of each other. The service time distribution of a customer by a server is of the phase (PH) type. If a group of primary calls meets idle servers the primary calls occupy the corresponding number of servers. If the number of idle servers is insufficient the rest of calls go to the orbit of unlimited size and repeat their attempts to get service after exponential amount of time independently of each other. Busy servers are subject to breakdowns and repairs. The common flow of breakdowns is the MAP. An event of this flow causes a failure of any busy server with equal probability. When a server fails the repair period starts immediately. This period has PH type distribution and does not depend on the repair time of other broken-down servers and the service time of customers occupying the working servers. A customer whose service was interrupted goes to the orbit with some probability and leaves the system with the supplementary probability. We derive the ergodicity condition and calculate the stationary distribution and the main performance characteristics of the system. Illustrative numerical examples are presented.     

相依修理的可修排队系统 MAP/PH(M/PH)/2

系统地研究了两个不同并行服务台的可修排队系统MAP/PH(M/PH)/2,其中两个不同的服务台拥有一个修理工.若其中一台处于修理状态,则另一台失效后就处于待修状态.利用拟生灭过程理论,我们首先讨论了两个服务台的广义服务时间的相依性,然后给出了系统的稳态可用度和稳态故障度,最后得到了系统首次失效前的时间分布及其均值.     

Optimal management of the machine repair problem with working vacation: Newton’s method

This paper studies the M/M/1 machine repair problem with working vacation in which the server works with different repair rates rather than completely terminating the repair during a vacation period. We assume that the server begins the working vacation when the system is empty. The failure times, repair times, and vacation times are all assumed to be exponentially distributed. We use the MAPLE software to compute steady-state probabilities and several system performance measures. A cost model is derived to determine the optimal values of the number of operating machines and two different repair rates simultaneously, and maintain the system availability at a certain level. We use the direct search method and Newton’s method for unconstrained optimization to repeatedly find the global minimum value until the system availability constraint is satisfied. Some numerical examples are provided to illustrate Newton’s method.     

The G/M/r machine interference model

This paper solves the machine interference problem in which N automatic machines are maintained by a team of r operatives. Repair times are assumed to follow a negative exponential distribution, and running times for each of the machines are assumed to be independently and identically distributed. It is shown that the solution to this G/M/r model is identical in most important respects to that for the M/M/r model.     

Transient analysis of a two-heterogeneous servers queue with system disaster,server repair and customers’ impatience

A two-heterogeneous servers queue with system disaster, server failure and repair is considered. In addition, the customers become impatient when the system is down. The customers arrive according to a Poisson process and service time follows exponential distribution. Each customer requires exactly one server for its service and the customers select the servers on fastest server first basis. Explicit expressions are derived for the time-dependent system size probabilities in terms of the modified Bessel function, by employing the generating function along with continued fraction and the identity of the confluent hypergeometric function. Further, the steady-state probabilities of the number of customers in the system are deduced and finally some important performance measures are obtained.     

PH/M/c可修排队系统

研究了一个修理工和c个服务台的可修排队系统.假设顾客的到达过程为PH更新过程,服务台在忙时与闲时具有不同的故障率.顾客的服务时间、服务台的寿命以及服务台的修理时间均服从指数分布.通过建立系统的拟生灭过程,得到了系统稳态分布存在的充要条件.利用矩阵几何解方法,给出了系统的稳态队长.在此基础上,得到了系统的某些排队论和可靠性指标.     

Reliability-based measures for a retrial system with mixed standby components

In this paper, we consider a retrial and repairable multi-component system with mixed warm and cold standby components. It is assumed that the failure times of primary (operating) and warm standby components follow exponential distributions. When a component fails, it is sent to a service station with a single server (repairman) and no waiting space. The failed component is repaired if the server is idle and it has to enter an orbit if the server is busy. The failed component in the orbit will try to get the repair service again after an exponentially distributed random time period. The repair time also has an exponential distribution. The mean time-to-failure, MTTF, and the steady-state availability, A_T(∞), are derived in this retrial and repairable system. Using a numerical example, we compare the systems with and without retrials in terms of the cost/benefit ratios. Sensitivity analysis for the mean time-to-failure and the steady-state availability are investigated as well.     

Efficiency and production rate of a transfer line with two machines and a finite storage buffer

A markov model for a transfer line with two unreliable machines separated by a finite storage size buffer is introduced. Service time distribution for the two machines is Erlang whereas failure and repair times are assumed to be exponential random variables. The paper presents an efficient method to solve analytically the steady state probabilities of the system. This method is independent of the buffer size. We also include in the paper a study of the behavior of some systems performance measures such as the efficiency of the two machines and the production rate of the system.     

The M/G/1 queue with disasters and working breakdowns

In this paper, we analyze the M/G/1 queueing system with disasters and working breakdown services. The system consists of a main server and a substitute server, and disasters only occur while the main server is in operation. The occurrence of disasters forces all customers to leave the system and causes the main server to fail. At a failure instant, the main server is sent to the repair shop and the repair period immediately begins. During the repair period, the system is equipped with the substitute server which provides the working breakdown services to arriving customers. After introducing the concept of working breakdown services, we derive the system size distribution and the sojourn time distribution. We also obtain the results of the cycle analysis. In addition, numerical works are given to examine the relation between the sojourn time and the some system parameters.     

Performance and reliability analysis of an M/G/1-G retrial queue with orbital search and non-persistent customers

This paper treats an M/G/1 retrial queue with non-persistent customers, where the server is subject to failure due to the negative arrivals. After a completion of a service or a repair, the server searches for the customers in the orbit or remains idle. By using embedded Markov chain technique and the supplementary variable method, we present the necessary and sufficient condition for the system to be stable and the joint queue length distribution in steady state. The waiting process is also given. Some main reliability measures, such as the availability, failure frequency, and the reliability function of the server, are obtained. Finally, some numerical examples and cost optimization analysis are presented.     

延迟控制休假的M／M／1排队系统

本文研究带有延迟休假的 Ｍ／Ｍ／１排队系统,服务员在空闲了一段时间（称做延迟时间）后才正式开始休假,每次休假的时间长度有指数分布．若一次休假结束时系统中的顾客数目低于某一水平Ｋ,则服务员开始另一次休假;否则转为投入服务,这时系统开始一个新的忙期。对于延迟时间有指数分布和是确定的情形分别求得系统的稳态分布的精确表示及某些性能指标．文章还讨论了系统优化问题,给出使得单位时间平均总成本最小的Ｋ值．证明在泊松到达的情形最优延迟时间是０（无延迟）或无穷（无休假）     

Vacation policies for machine repair problem with two type spares

This paper studies the machine repair problem consisting of M operating machines with two types of spare machines (S = S₁ + S₂), 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 and operate two vacation policies. First, the servers take vacations repeatedly until they find the repair facility has at least one waiting failed machine in the queue. Second, the servers do not take a vacation again and remain idle until the first arriving failed machine arrives, which starts a busy period in the repair facility. For both policies, the servers have two service rates for repair-slow and fast. The matrix geometric theory is used to find the steady-state probabilities of the number of failed machines in the system as well as the performance measures. Some special cases are given. A direct search algorithm is used to simultaneously determine the optimal values of the number of two types of spares and the number of servers while maintaining a minimum specified level of system availability.