IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v5y2013i5p571-603.html
   My bibliography  Save this article

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 − ∞

Author

Listed:
  • Aliakbar Montazer Haghighi
  • Dimitar P. Mishev

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.

Suggested Citation

  • Aliakbar Montazer Haghighi & Dimitar P. Mishev, 2013. "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 − ∞," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 5(5), pages 571-603.
    • Handle: RePEc:ids:ijmore:v:5:y:2013:i:5:p:571-603
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=56100
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijmore:v:5:y:2013:i:5:p:571-603. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.