An improved MIP-based approach for a multi-skill workforce scheduling problem

121Citations
Citations of this article
155Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper deals with scheduling complex tasks with an inhomogeneous set of resources. The problem is to assign technicians to tasks with multi-level skill requirements. Here, the requirements are merely the presence of a set of technicians that possess the necessary capabilities. An additional complication is that a set of combined technicians stays together for the duration of a work day. This typically applies to scheduling of maintenance and installation operations. We build schedules by repeated application of a flexible matching model that selects tasks to be processed and forms groups of technicians assigned to combinations of tasks. The underlying mixed integer programming (MIP) model is capable of revising technician-task allocations and performs very well, especially in the case of rare skills. © The Author(s) 2011.

Cite

CITATION STYLE

APA

Firat, M., & Hurkens, C. A. J. (2012). An improved MIP-based approach for a multi-skill workforce scheduling problem. Journal of Scheduling, 15(3), 363–380. https://doi.org/10.1007/s10951-011-0245-x

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free