IDEAS home Printed from https://ideas.repec.org/h/spr/prbchp/978-3-319-58589-5_9.html
   My bibliography  Save this book chapter

Optimal Selection of Superlative Candidates for Open Positions Using Linear Programming

In: Emerging Challenges in Business, Optimization, Technology, and Industry

Author

Listed:
  • Abdelghani Bouras

    (King Saud University)

Abstract

Due to the extensions of businesses, companies have multi-positions to be filled every year. On the other hand, many experienced as well as fresh applicants are looking for new experiences that challenge their abilities, stimulate their knowledge, and increase their income. In a very robust competitive environment, leading organizations are looking for appropriate qualified people to cover the open positions that result from the business extension or from vacancies due to resignations and lack of capabilities. The usual practice of originations is to hold nominee applications with the recruiting unit. Thus, the objective of the research is to provide the Human Resources Department with a valid systematic methodology to ensure that highly qualified employees are selected as soon as a department needs them, and then to guarantee the appropriateness of the final selection in terms of multi-qualifications criteria. We develop a mathematical model to help the HR department of a local bank select candidates classified into three categories, experts, fresh graduates, and processors, based on the following criteria: For experts, the model considers specialty, languages, interview feedback, residency, age, years of experience, and required packages. Concerning graduates and processors, we consider major, languages, interview feedback, residency, age, bank’s IQ test, and GPA. The model, an integer program, is built to satisfy the following requirements: The minimum number of required employees, the field of experience, and the major Language constraints Interview score requirements Residency requirements IQ test related to the whole applicants Number of years of experience score Required package as opposed to other applicants GPA score The minimization of the objective function consists of selecting the least number of candidates who satisfy all the constraints above. The model is a very fast tool for helping the Bank to use rationally the existing resources and making the best decision in terms of selection of the most adequate candidates.

Suggested Citation

  • Abdelghani Bouras, 2018. "Optimal Selection of Superlative Candidates for Open Positions Using Linear Programming," Springer Proceedings in Business and Economics, in: Lotfi Tadj & Ajay K. Garg (ed.), Emerging Challenges in Business, Optimization, Technology, and Industry, pages 143-144, Springer.
  • Handle: RePEc:spr:prbchp:978-3-319-58589-5_9
    DOI: 10.1007/978-3-319-58589-5_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:prbchp:978-3-319-58589-5_9. 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: 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.