Stable multi-skill workforce assignments
- 387 Downloads
This paper analyzes stability in multi-skill workforce assignments of technicians and jobs. In our stability analysis, we extend the notion of blocking pairs as stated in the Marriage model of Gale-Shapley to the multi-skill workforce assignment. It is shown that finding stable assignments is NP-hard. A special case turns out to be solvable in polynomial time. For the general case, we give a characterization of the set of stable assignments by means of linear inequalities involving binary variables. We propose an integer programming (IP) model to construct optimal stable assignments with several objectives. In the computational results, we observe that it is easier to attain stability in instances with easy jobs and we consider a range of instances to show how fast the solution time increases. Open questions and further directions are discussed in the conclusion section.
KeywordsMulti-skill workforce schedules Stable assignments Instability Blocking pair University admissions problem Three-dimensional matching problem Optimal stable assignments
This research is supported by France Telecom/TUE Research agreement No. 46145963. Thanks are due to Gerhard J. Woeginger for helpful discussions on complexity results and due to Judith C.M. Keijsper for her remarks on the notation of this paper. The reviewers deserve special thanks due to their comments on our proofs and on our IP models. Their comments helped a lot in improving the content of this paper.
- Bellenguez, M. O., & Neron, E. (2004). Lower bounds for the multi-skill project scheduling problem with hierarchical levels of skills. In Proceedings of practice and theory of automated timetabling (PATAT2004), Pittsburgh, PA, USA (pp. 429–432). Google Scholar
- Estellon, B., Gardi, F., & Nouioua, K. (2009). High-performance local search for task scheduling with human resource allocation. In Lect Notes Comput Sci (Vol. 5752, pp. 1–15). Google Scholar
- Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness (p. 221). San Francisco: Freeman. Google Scholar
- Gelain, M., Pini, M. S., Rossi, F., Venable, K. B., & Walsh, T. (2010). Local search for stable marriage problem. In Proceedings of COMSOC 2010, Düsseldorf, Germany. Google Scholar
- Heimerl, C., & Kolisch, R. (2010). Scheduling and staffing multiple projects with a multi-skilled workforce. IEEE Spectr, 32(2), 343–368. Google Scholar
- Iwama, K., Manlove, D. F., Miyazaki, S., & Morita, Y. (1999). Stable marriage with incomplete lists and ties. In Lecture notes in computer science: Vol. 1644. Proceedings of ICALP 99 (pp. 443–452). Berlin: Springer. Google Scholar
- Iwama, K., Miyazaki, S., & Okamoto, K. (2004). A (2-clogN/N)-approximation algorithm for the stable marriage problem. In Lecture notes in computer science: Vol. 3111. Proceedings of SWAT 2004 (pp. 349–361). Berlin: Springer. Google Scholar
- Vande Vate, J. H. (1989). Linear programming brings marital bliss. OR Lett, 8, 147–153. Google Scholar