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-
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.
- scientific article; zbMATH DE number 169305
- scientific article; zbMATH DE number 123816
- A cyclic service tandem queueing model with parallel queues in the first stage
- scientific article; zbMATH DE number 719413
- The analysis, optimization, and simulation of a two-stage tandem queueing model with hyperexponential service time at second stage
- Batch arrival bulk service queue with unreliable server, second optional service, two different vacations and restricted admissibility policy
- An \(M^X/G(a,b)/1\) queue with breakdown and delay time to two phase repair under multiple vacation
- scientific article; zbMATH DE number 7582867 (Why is no real title available?)
- Analysis of \(MAP/PH/1\) queueing model with breakdown, instantaneous feedback and server vacation
- Analysis of two stage \(M^{[X_{1}]}\), \(M^{[X_{2}]}/G_1\), \(G_2/1\) retrial G-queue with discretionary priority services, working breakdown, Bernoulli vacation, preferred and impatient units
- Analysis of \(M^{[X_{1}]}\), \(M^{[X_{2}]}/G_1\), \(G_2/1\) retrial queueing system with priority services, working breakdown, collision, Bernoulli vacation, immediate feedback, starting failure and repair
- scientific article; zbMATH DE number 7644908 (Why is no real title available?)
- scientific article; zbMATH DE number 7704579 (Why is no real title available?)
This page was built for publication: 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\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1753791)