A decomposition heuristic for short-term planning of assessment centres

Rihm, Tom; Trautmann, Norbert (2017). A decomposition heuristic for short-term planning of assessment centres. European journal of industrial engineering, 11(6), pp. 725-751. Inderscience Publishers 10.1504/EJIE.2017.10006711

Full text not available from this repository. (Request a copy)

In an assessment centre, several candidates for a job vacancy perform a set of predefined tasks while being observed and evaluated by so-called assessors. For the organisers of such assessment centres, a challenging job is to schedule the tasks and assign the prescribed number of assessors to the tasks such that the total waiting time for the assessors is minimised. This planning situation has been reported to us by a human resource management service provider. Application-specific restrictions distinguish this problem from related scheduling problems discussed in the literature, e.g., the resource-constrained project scheduling problem. We present a mixed-integer programming-based decomposition heuristic, which iterates between pre-scheduling, assignment, and re-scheduling subproblems. Our computational results demonstrate that this novel heuristic outperforms the state-of-the-art approaches on a set of 240 benchmark instances. Furthermore, this heuristic provides optimal solutions to a set of four real-life instances.

Item Type:

Journal Article (Original Article)


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:

Rihm, Tom and Trautmann, Norbert


600 Technology > 650 Management & public relations




Inderscience Publishers




Juliana Kathrin Zurbrügg

Date Deposited:

04 Apr 2018 10:55

Last Modified:

28 Jan 2020 13:49

Publisher DOI:




Actions (login required)

Edit item Edit item
Provide Feedback