IDEAS home Printed from https://ideas.repec.org/p/hhb/aarbls/2008-001.html
   My bibliography  Save this paper

Scheduling participants of Assessment Centres

Author

Listed:
  • Lysgaard, Jens

    (Department of Business Studies, Aarhus School of Business)

  • Løber, Janni

    (Human Equity)

Abstract

Assessment Centres are used as a tool for psychologists and coaches to ob- serve a number of dimensions in a person's behaviour and test his/her potential within a number of chosen focus areas. This is done in an intense course, with a number of di erent exercises which expose each participant's ability level in the chosen focus areas. The participants are observed by assessors with the purpose of gathering material for reaching a conclusion on each participant's personal pro le. We consider the particular case that arises at the company Human Equity (www.humanequity.dk), where Assessment Centres usually last two days and involve 3-6 psychologists or trained coaches as assessors. An entire course is composed of a number of rounds, with each round having its individual duration. In each round, the participants are divided into a number of groups with prespeci ed pairing of group sizes and assessors. The scheduling problem amounts to determining the allocation of participants to groups in each round. We have developed a model and solution approach for this particular scheduling problem, which may be viewed as a rather extensive generalization of the Social Golfer Problem.

Suggested Citation

  • Lysgaard, Jens & Løber, Janni, 2008. "Scheduling participants of Assessment Centres," CORAL Working Papers L-2008-01, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    • Handle: RePEc:hhb:aarbls:2008-001
    as

    Download full text from publisher

    File URL: http://www.hha.dk/bs/wp/log/L_2008_01.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Opasanon, Sathaporn & Miller-Hooks, Elise, 2006. "Multicriteria adaptive paths in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 173(1), pages 72-91, August.
    2. Uchoa, Eduardo & Fukasawa, Ricardo & Lysgaard, Jens & Pessoa, Artur & Poggi de Aragão, Marcus & Andrade, Diogo, 2006. "Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation," CORAL Working Papers L-2006-08, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    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. Kjeldsen, Karina Hjortshøj, 2008. "Classification of routing and scheduling problems in liner shipping," CORAL Working Papers L-2008-06, University of Aarhus, Aarhus School of Business, Department of Business Studies.

    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. S. Khodayifar & M. A. Raayatpanah & P. M. Pardalos, 2019. "A polynomial time algorithm for the minimum flow problem in time-varying networks," Annals of Operations Research, Springer, vol. 272(1), pages 29-39, January.
    2. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
    3. Prakash, A. Arun, 2018. "Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 127-147.
    4. He Huang & Song Gao, 2018. "Trajectory-Adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times," Transportation Science, INFORMS, vol. 52(1), pages 102-117, January.
    5. Xie, Chi & Travis Waller, S., 2012. "Parametric search and problem decomposition for approximating Pareto-optimal paths," Transportation Research Part B: Methodological, Elsevier, vol. 46(8), pages 1043-1067.
    6. Zhaoqi Zang & Xiangdong Xu & Kai Qu & Ruiya Chen & Anthony Chen, 2022. "Travel time reliability in transportation networks: A review of methodological developments," Papers 2206.12696, arXiv.org, revised Jul 2022.
    7. Ziliaskopoulos, Athanasios K. & Mandanas, Fotios D. & Mahmassani, Hani S., 2009. "An extension of labeling techniques for finding shortest path trees," European Journal of Operational Research, Elsevier, vol. 198(1), pages 63-72, October.
    8. Koch, Ronald & Nasrabadi, Ebrahim, 2014. "Flows over time in time-varying networks: Optimality conditions and strong duality," European Journal of Operational Research, Elsevier, vol. 237(2), pages 580-589.
    9. Kjeldsen, Karina Hjortshøj, 2008. "Classification of routing and scheduling problems in liner shipping," CORAL Working Papers L-2008-06, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    10. Camacho-Collados, M. & Liberatore, F. & Angulo, J.M., 2015. "A multi-criteria Police Districting Problem for the efficient and effective design of patrol sector," European Journal of Operational Research, Elsevier, vol. 246(2), pages 674-684.
    11. Ghatee, Mehdi & Hashemi, S. Mehdi, 2009. "Traffic assignment model with fuzzy level of travel demand: An efficient algorithm based on quasi-Logit formulas," European Journal of Operational Research, Elsevier, vol. 194(2), pages 432-451, April.

    More about this item

    Keywords

    No keywords;

    Statistics

    Access and download statistics

    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:hhb:aarbls:2008-001. 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: Helle Vinbaek Stenholt (email available below). General contact details of provider: https://edirc.repec.org/data/ifhhadk.html .

    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.