Advertisement

Annals of Operations Research

, Volume 213, Issue 1, pp 95–114 | Cite as

Stable multi-skill workforce assignments

  • Murat FıratEmail author
  • C. A. J. Hurkens
  • Alexandre Laugier
Article

Abstract

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.

Keywords

Multi-skill workforce schedules Stable assignments Instability Blocking pair University admissions problem Three-dimensional matching problem Optimal stable assignments 

Notes

Acknowledgements

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.

References

  1. Avramidis, N. A., Chan, W., Gendreau, M., L’Ecuyer, P., & Pisacane, O. (2010). Optimizing daily agent scheduling in a multi-skill call center. Eur J Oper Res, 200(3), 822–832. CrossRefGoogle Scholar
  2. Baïou, M., & Balinski, M. (2000a). The stable admissions polytope. Math Program, 87(3), 427–439. CrossRefGoogle Scholar
  3. Baïou, M., & Balinski, M. (2000b). Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry). Discrete Appl Math, 101, 1–12. CrossRefGoogle Scholar
  4. 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
  5. Bellenguez, M. O., & Neron, E. (2007). A Branch-and-bound method for solving multi-skill project scheduling problem. RAIRO Rech Opér, 41, 155–170. CrossRefGoogle Scholar
  6. Cordeau, J. F., Laporte, G., Pasin, F., & Ropke, S. (2010). Scheduling technicians and tasks in a telecommunication company. J Sched, 13(4), 393–409. CrossRefGoogle Scholar
  7. 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
  8. Fırat, M., & Hurkens, C. A. J. (2012). An improved MIP-based approach for a multi-skill workforce scheduling problem. J Sched, 15(3), 363–380. CrossRefGoogle Scholar
  9. Fleiner, T., Irving, R. W., & Manlove, D. F. (2007). Efficient algorithms for generalized stable marriage and roommates problems. Theor Comput Sci, 381, 162–176. CrossRefGoogle Scholar
  10. Gale, D., & Shapley, L. S. (1962). College admissions and the stability of marriage. Am Math Mon, 69(1), 9–15. CrossRefGoogle Scholar
  11. Gale, D., & Sotomayor, M. (1985). Some remarks on the stable matching problem. Discrete Appl Math, 11, 223–232. CrossRefGoogle Scholar
  12. 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
  13. 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
  14. Heimerl, C., & Kolisch, R. (2010). Scheduling and staffing multiple projects with a multi-skilled workforce. IEEE Spectr, 32(2), 343–368. Google Scholar
  15. Hurkens, C. A. J. (2009). Incorporating the strength of MIP modeling in schedule construction. RAIRO Rech Opér, 43, 409–420. CrossRefGoogle Scholar
  16. 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
  17. 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
  18. Iwama, K., Miyazaki, S., & Yamauchi, N. (2008). A (2-\(c 1 / \sqrt{N}\))-approximation algorithm for the stable marriage problem. Algorithmica, 51(3), 902–914. CrossRefGoogle Scholar
  19. Li, H., & Womer, K. (2009). Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm. J Sched, 12(3), 281–298. CrossRefGoogle Scholar
  20. Valls, V., Perez, A., & Quintanilla, S. (2009). Skill workforce scheduling in service centers. Eur J Oper Res, 193(3), 791–804. CrossRefGoogle Scholar
  21. Vande Vate, J. H. (1989). Linear programming brings marital bliss. OR Lett, 8, 147–153. Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Murat Fırat
    • 1
    Email author
  • C. A. J. Hurkens
    • 1
  • Alexandre Laugier
    • 2
  1. 1.Department of Mathematics and Computer ScienceTU EindhovenEindhovenThe Netherlands
  2. 2.France Telecom/R&D/BIZZ/DIAM 905Sophia-Antipolis CedexFrance

Personalised recommendations