Stable multi-skill workforce assignments

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

10 Citaties (Scopus)
4 Downloads (Pure)

Uittreksel

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
Originele taal-2Engels
Pagina's (van-tot)95-114
Aantal pagina's20
TijdschriftAnnals of Operations Research
Volume213
Nummer van het tijdschrift1
DOI's
StatusGepubliceerd - 2014

Vingerafdruk

Workforce
Assignment
Integer programming
Stability analysis
NP-hard
Schedule
Key words
Marriage
Polynomials
Admission
Matching problem

Citeer dit

@article{43e202698fe34b47a4dd543a0d95edc8,
title = "Stable multi-skill workforce assignments",
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",
author = "M. Firat and C.A.J. Hurkens and A. Laugier",
year = "2014",
doi = "10.1007/s10479-012-1224-0",
language = "English",
volume = "213",
pages = "95--114",
journal = "Annals of Operations Research",
issn = "0254-5330",
publisher = "Springer",
number = "1",

}

Stable multi-skill workforce assignments. / Firat, M.; Hurkens, C.A.J.; Laugier, A.

In: Annals of Operations Research, Vol. 213, Nr. 1, 2014, blz. 95-114.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

TY - JOUR

T1 - Stable multi-skill workforce assignments

AU - Firat, M.

AU - Hurkens, C.A.J.

AU - Laugier, A.

PY - 2014

Y1 - 2014

N2 - 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

AB - 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

U2 - 10.1007/s10479-012-1224-0

DO - 10.1007/s10479-012-1224-0

M3 - Article

VL - 213

SP - 95

EP - 114

JO - Annals of Operations Research

JF - Annals of Operations Research

SN - 0254-5330

IS - 1

ER -