On the heterogeneous machine interference with limited server's availability (Q1088582): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimal control of finite source priority queues with computer system applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3658880 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Priority queues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Time-shared Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3308818 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:45, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the heterogeneous machine interference with limited server's availability |
scientific article |
Statements
On the heterogeneous machine interference with limited server's availability (English)
0 references
1987
0 references
Three models are developed for the heterogeneous machine interference problem where the occurrence of ancillary duty makes the operator non- available for repair activities. The machines are supposed to be stochastically different, the i-th machine is characterized by exponentially distributed running time with parameter \(\lambda_ i^{- 1}\) and exponentially distributed required repair time with mean \(1/\mu_ i\). The ancillary duty which has preemptive priority over the machines arises randomly being governed by exponential law with rate depending on the operator's state, i.e., whether he is busy or idle. The time taken to complete an ancillary duty is assumed to be an exponentially distributed random variable. The machines are repaired according to first-in, first-out (FIFO), priority processor sharing (PPS) and preemptive resume priority (PR) service disciplines. The aim of the present paper is to give the main steady-state characteristics of the system, such as operative utilization, mean length of busy period, average number of machines not in working order, machine productivity and duration of time while the machines are failing. In addition some optimization problems are treated. Finally, numerical examples illustrate the problem in question.
0 references
running time
0 references
repair time
0 references
heterogeneous machine interference problem
0 references
ancillary duty
0 references
preemptive priority
0 references
steady-state characteristics
0 references
mean length of busy period
0 references