Stable multi-skill workforce assignments
From MaRDI portal
Publication:744637
DOI10.1007/s10479-012-1224-0zbMath1296.90071MaRDI QIDQ744637
Murat Fırat, Alexandre Laugier, Cor A. J. Hurkens
Publication date: 26 September 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-012-1224-0
instability; stable assignments; blocking pair; multi-skill workforce schedules; optimal stable assignments; three-dimensional matching problem; university admissions problem
90C10: Integer programming
90B35: Deterministic scheduling theory in operations research
90B80: Discrete location and assignment
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling technicians and tasks in a telecommunications company
- Skilled workforce scheduling in service centres
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
- Efficient algorithms for generalized stable marriage and roommates problems
- Optimizing daily agent scheduling in a multiskill call center
- Some remarks on the stable matching problem
- Linear programming brings marital bliss
- The stable admissions polytope
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Scheduling and staffing multiple projects with a multi-skilled workforce
- An improved MIP-based approach for a multi-skill workforce scheduling problem
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
- Incorporating the strength of MIP modeling in schedule construction
- Algorithm Theory - SWAT 2004
- Algorithms and Computation
- College Admissions and the Stability of Marriage
