Stochastic three-stage hiring model as a tandem queueing process with bulk arrivals and Erlang phase-type selection, \(M^X/M^{(k,K)}/1-M^Y/E_r/1-\infty\) (Q1753791)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Stochastic three-stage hiring model as a tandem queueing process with bulk arrivals and Erlang phase-type selection, \(M^X/M^{(k,K)}/1-M^Y/E_r/1-\infty\) |
scientific article |
Statements
Stochastic three-stage hiring model as a tandem queueing process with bulk arrivals and Erlang phase-type selection, \(M^X/M^{(k,K)}/1-M^Y/E_r/1-\infty\) (English)
0 references
29 May 2018
0 references
Summary: We consider three possible stages for the handling of job applications in a hiring process as a network queuing model. Applications arrive at the first stage in batches of variable sizes according to Poisson process and are compiled in an `A-Box'. The batches of variable sizes (within a given minimum and maximum) are processed by a single-processor according to exponential distribution. The accepted portion of each processed batch moves to the second stage, the interview phase, and are piled in an `I-Box'. The interviews are conducted according to Erlang phase type; each phase according to exponential distribution. The successful applications are, then, directed to the third stage, final hiring phase, and are piled in an `H-Box'. Using decomposition of the system, we find generation functions and the mean of the number of applications in each of the first two stages. Explicit distributions of the number of applications are found for special cases and numerical examples are also provided.
0 references
hiring process
0 references
queueing model
0 references
network
0 references
Erlang phase type
0 references
Poisson
0 references
exponential
0 references
bulk
0 references
batch
0 references
single processor
0 references
decomposition
0 references