Stochastic three-stage hiring model as a tandem queueing process with bulk arrivals and Erlang phase-type selection, MX/M(k,K)/1 − MY/Er/1 − ∞ Online publication date: Sun, 11-Aug-2013
by Aliakbar Montazer Haghighi; Dimitar P. Mishev
International Journal of Mathematics in Operational Research (IJMOR), Vol. 5, No. 5, 2013
Abstract: 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.
Online publication date: Sun, 11-Aug-2013
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com