We consider an extended form of the MX/M/c queue with two types server groups: Static as well dynamic (which turn on/off in a state-dependent manner) servers. The groups may have homogenous or non-homogenous service rates. model is further to feature setup and delayed-off times, finite capacity, k staffing levels. This class queues solved via difference equations approach, which addresses narra...

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

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

In this investigation, the explicit expressions for reliability function and mean time to failure (MTTF) of a repairable system with provision of spares and removable multi-repair facility have been established. In removable repairmen strategy, the repairmen turn on when there are N or more than N failed units and turn-off when system is empty. The failure times of operating/spare units and rep...

in this paper we define the removable cycle that, if $im$ is a class of graphs, $gin im$, the cycle $c$ in $g$ is called removable if $g-e(c)in im$. the removable cycles in eulerian graphs have been studied. we characterize eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for eulerian graph to have removable cycles h...

‎in this paper we defined the vertex removable cycle in respect of the following‎, ‎if $f$ is a class of graphs(digraphs)‎ ‎satisfying certain property‎, ‎$g in f $‎, ‎the cycle $c$ in $g$ is called vertex removable if $g-v(c)in in f $.‎ ‎the vertex removable cycles of eulerian graphs are studied‎. ‎we also characterize the edge removable cycles of regular‎ ‎graphs(digraphs).‎

In August 1998, an interviewer for an Indonesian news weekly asked Amien Rais, a major figure in national Islamic politics and founder of the National Mandate Party (Partai Amanat Nasional), why he had altered the name of the party from the originally proposed Partai Amanat Bangsa. He replied, “We chose Partai Amanat Nasional because it would be better translated into English as National Mandat...

In this paper we define the removable cycle that, if $Im$ is a class of graphs, $Gin Im$, the cycle $C$ in $G$ is called removable if $G-E(C)in Im$. The removable cycles in Eulerian graphs have been studied. We characterize Eulerian graphs which contain two edge-disjoint removable cycles, and the necessary and sufficient conditions for Eulerian graph to have removable cycles h...

this paper analyzes an m/m/2 queueing system with two heterogeneous servers. both servers goes on vacation when there is no customers waiting for service after this server 1 is always available but the other goes on vacation whenever server 2 is idle. the vacationing server however, returns to serve at a low rate as an arrival finds the other server busy. the system is analyzed in the steady st...