Zimmermann, Adrian; Trautmann, Norbert (2018). A list-scheduling heuristic for the short-term planning of assessment centers. Journal of scheduling, 21(2), pp. 131-142. Springer US; http://www.springer-ny.com 10.1007/s10951-017-0521-5
|
Text
art%3A10.1007%2Fs10951-017-0521-5 (2).pdf - Published Version Available under License Publisher holds Copyright. Download (638kB) | Preview |
Many companies operate assessment centers to help them select candidates for open job positions. During the assessment process, each candidate performs a set of tasks, and the candidates are evaluated by some so-called assessors. Additional constraints such as preparation and evaluation times, actors’ participation in tasks, no-go relationships, and prescribed time windows for lunch breaks contribute to the complexity of planning such assessment processes. We propose a multi-pass list-scheduling heuristic for this novel planning problem; to this end, we develop novel procedures for devising appropriate scheduling lists and for generating a feasible schedule. The computational results for a set of example problems that represent or are derived from real cases indicate that the heuristic generates optimal or near-optimal schedules within relatively short CPU times.
Item Type: |
Journal Article (Original Article) |
---|---|
Division/Institute: |
03 Faculty of Business, Economics and Social Sciences > Department of Business Management > Institute of Financial Management > Professorship for Quantitative Methods in Business Administration |
UniBE Contributor: |
Zimmermann, Adrian, Trautmann, Norbert |
Subjects: |
600 Technology > 650 Management & public relations |
ISSN: |
1094-6136 |
Publisher: |
Springer US; http://www.springer-ny.com |
Language: |
English |
Submitter: |
Juliana Kathrin Moser-Zurbrügg |
Date Deposited: |
12 Jul 2017 13:07 |
Last Modified: |
05 Dec 2022 15:05 |
Publisher DOI: |
10.1007/s10951-017-0521-5 |
BORIS DOI: |
10.7892/boris.99626 |
URI: |
https://boris.unibe.ch/id/eprint/99626 |