Kassoum Traore Processing Time of an Application in a Stochastic Hiring Model
Department of Mathematics
Prairie View A&M University, Prairie View, TX
COLLOQUIUM
Kassoum Traore
kasstraore@live.com
Graduate Student at Prairie view A&M
Presents
Processing Time of an Application in a
Stochastic Hiring Model
Mentor: Dr. A.M. Haghighi
When: Friday, December 06, 2013
Time: 2 pm
Where: W.R. Banks Building -309
Abstract
In this study, we consider a hiring process as a network queueing model with three stages. Applications arrive at the first stage in batches of variable sizes according to
Poisson process and are compiled in 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 another box. The interviews are conducted according to
Erlang phase type; each phase according to exponential distribution. The successful applications are, then, directed to the final stage, hiring phase. We use two different probability distributions for the batch size of the model. We find the mean, variance and the waiting time at each stage. A particular case of interest is discussed. A numerical example is also provided in each stage.
Questions: contact Dr. Natali Hritonenko nahritonenko@pvamu.edu
