IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v295y2020i2d10.1007_s10479-020-03822-2.html
   My bibliography  Save this article

Analysis and optimization of recruitment stocking problems

Author

Listed:
  • Anh Ninh

    (William & Mary)

  • Benjamin Melamed

    (Rutgers University)

  • Yao Zhao

    (Rutgers University)

Abstract

We study a new class of inventory control problems, the recruitment stocking problem (RSP), applicable to general recruitment systems and products with limited supplies. Recruitment stocking occurs routinely in many organizations with the goal of identifying qualified candidates rapidly and cost effectively. This activity may take place at multiple sites simultaneously to shorten the recruitment time. Examples include recruiting patients in clinical trials, enlisting personnel in the military, and recruiting customers for product sampling in market testing and promotion. RSP differs from the extant inventory management literature in that it stipulates a finite recruitment target, so that recruitment is terminated as soon as the total number of recruits across all locations reaches that prescribed target. This distinctive feature of RSP calls for the development of new stochastic models to evaluate and optimize system performance. Thus, we present a novel methodology of relaxation and decomposition to characterize the probability distribution of rejections in RSP (number of arrivals to an empty inventory). This method provides a basis for efficient and accurate evaluation of the Type 2 service level and expected recruitment time. We also leverage the attendant computational efficiency to develop optimization algorithms to compute the optimal stocking quantities.

Suggested Citation

  • Anh Ninh & Benjamin Melamed & Yao Zhao, 2020. "Analysis and optimization of recruitment stocking problems," Annals of Operations Research, Springer, vol. 295(2), pages 747-767, December.
    • Handle: RePEc:spr:annopr:v:295:y:2020:i:2:d:10.1007_s10479-020-03822-2
    DOI: 10.1007/s10479-020-03822-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-020-03822-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-020-03822-2?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. Bennett Fox, 1966. "Discrete Optimization Via Marginal Analysis," Management Science, INFORMS, vol. 13(3), pages 210-216, November.
    2. András Prékopa & Anh Ninh & Gabriela Alexe, 2016. "On the relationship between the discrete and continuous bounding moment problems and their numerical solutions," Annals of Operations Research, Springer, vol. 238(1), pages 521-575, March.
    3. András Prékopa & Anh Ninh & Gabriela Alexe, 2016. "On the relationship between the discrete and continuous bounding moment problems and their numerical solutions," Annals of Operations Research, Springer, vol. 238(1), pages 521-575, March.
    4. Adam Fleischhacker & Anh Ninh & Yao Zhao, 2015. "Positioning Inventory in Clinical Trial Supply Chains," Production and Operations Management, Production and Operations Management Society, vol. 24(6), pages 991-1011, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Chen, Weiwei & Kumcu, Gül Çulhan & Melamed, Benjamin & Baveja, Alok, 2023. "Managing resource allocation for the recruitment stocking problem," Omega, Elsevier, vol. 120(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Talal Alharbi & Anh Ninh & Ersoy Subasi & Munevver Mine Subasi, 2022. "The value of shape constraints in discrete moment problems: a review and extension," Annals of Operations Research, Springer, vol. 318(1), pages 1-31, November.
    2. Anh Ninh & Honggang Hu & David Allen, 2019. "Robust newsvendor problems: effect of discrete demands," Annals of Operations Research, Springer, vol. 275(2), pages 607-621, April.
    3. Anh Ninh, 2021. "Robust newsvendor problems with compound Poisson demands," Annals of Operations Research, Springer, vol. 302(1), pages 327-338, July.
    4. M. A. Goberna & M. A. López, 2018. "Recent contributions to linear semi-infinite optimization: an update," Annals of Operations Research, Springer, vol. 271(1), pages 237-278, December.
    5. Mariya Naumova & András Prékopa, 2021. "Bounding the values of financial derivatives by the use of the moment problem," Annals of Operations Research, Springer, vol. 305(1), pages 211-225, October.
    6. M. A. Goberna & M. A. López, 2017. "Recent contributions to linear semi-infinite optimization," 4OR, Springer, vol. 15(3), pages 221-264, September.
    7. Noordhoek, Marije & Dullaert, Wout & Lai, David S.W. & de Leeuw, Sander, 2018. "A simulation–optimization approach for a service-constrained multi-echelon distribution network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 114(C), pages 292-311.
    8. Ching, Wai Ki, 1997. "Markov-modulated Poisson processes for multi-location inventory problems," International Journal of Production Economics, Elsevier, vol. 53(2), pages 217-223, November.
    9. Mustafa Doğru & A. Kok & G. Houtum, 2013. "Newsvendor characterizations for one-warehouse multi-retailer inventory systems with discrete demand under the balance assumption," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(3), pages 541-559, September.
    10. Xiuli Chao & Liming Liu & Shaohui Zheng, 2003. "Resource Allocation in Multisite Service Systems with Intersite Customer Flows," Management Science, INFORMS, vol. 49(12), pages 1739-1752, December.
    11. Kochel, P., 2007. "Order optimisation in multi-location models with hub-and-spoke structure," International Journal of Production Economics, Elsevier, vol. 108(1-2), pages 368-387, July.
    12. Peng Ma & Yeming Gong & Mingzhou Jin, 2019. "Quality efforts in medical supply chains considering patient benefits," Post-Print hal-02312386, HAL.
    13. Thomas L. Morin & Roy E. Marsten, 1974. "Brand-and-Bound Strategies for Dynamic Programming," Discussion Papers 106, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    14. Xiaobo Zhao & Fan Fan & Xiaoliang Liu & Jinxing Xie, 2007. "Storage-Space Capacitated Inventory System with ( r, Q ) Policies," Operations Research, INFORMS, vol. 55(5), pages 854-865, October.
    15. Benjaafar, Saifallah, 1995. "Performance bounds for the effectiveness of pooling in multi-processing systems," European Journal of Operational Research, Elsevier, vol. 87(2), pages 375-388, December.
    16. Pourya Pourhejazy, 2020. "Destruction Decisions for Managing Excess Inventory in E-Commerce Logistics," Sustainability, MDPI, vol. 12(20), pages 1-12, October.
    17. Yossi Aviv & Awi Federgruen, 2001. "Design for Postponement: A Comprehensive Characterization of Its Benefits Under Unknown Demand Distributions," Operations Research, INFORMS, vol. 49(4), pages 578-598, August.
    18. Li Ding & Kevin D. Glazebrook & Christopher Kirkbride, 2008. "Allocation Models and Heuristics for the Outsourcing of Repairs for a Dynamic Warranty Population," Management Science, INFORMS, vol. 54(3), pages 594-607, March.
    19. Sridhar Seshadri & Jayashankar M. Swaminathan, 2003. "A componentwise index of service measurement in multi‐component systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(2), pages 184-194, March.
    20. Feng Cheng* & Markus Ettl & Yingdong Lu & David D. Yao, 2012. "A Production–Inventory Model for a Push–Pull Manufacturing System with Capacity and Service Level Constraints," Production and Operations Management, Production and Operations Management Society, vol. 21(4), pages 668-681, July.

    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:spr:annopr:v:295:y:2020:i:2:d:10.1007_s10479-020-03822-2. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.