Stable multi-skill workforce assignments
DOI10.1007/S10479-012-1224-0zbMATH Open1296.90071OpenAlexW2006012969MaRDI QIDQ744637FDOQ744637
Authors: M. Fırat, A. Laugier, Cor 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
Recommendations
- Multi-skilled workforce optimisation
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills
- Skilled workforce scheduling in service centres
- On a multi-project staffing problem with heterogeneously skilled workers
- A mixed integer programming approach to multi-skilled workforce scheduling
- Stability of Manpower Systems
- Dynamic assignment of a multi-skilled workforce in job shops: an approximate dynamic programming approach
- Workforce scheduling with multiple objectives
- Multi-objective Large-Scale Staff Allocation
instabilitystable assignmentsblocking pairmulti-skill workforce schedulesoptimal stable assignmentsthree-dimensional matching problemuniversity admissions problem
Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Some remarks on the stable matching problem
- College Admissions and the Stability of Marriage
- Scheduling and staffing multiple projects with a multi-skilled workforce
- Scheduling technicians and tasks in a telecommunications company
- Optimizing daily agent scheduling in a multiskill call center
- Skilled workforce scheduling in service centres
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- An improved MIP-based approach for a multi-skill workforce scheduling problem
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
- Linear programming brings marital bliss
- The stable admissions polytope
- Title not available (Why is that?)
- Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)
- Elicitation strategies for soft constraint problems with missing preferences: properties, algorithms and experimental studies
- Efficient algorithms for generalized stable marriage and roommates problems
- Incorporating the strength of MIP modeling in schedule construction
- Algorithm Theory - SWAT 2004
- Algorithms and Computation
Cited In (5)
- Robust competence assessment for job assignment
- On the complexity of efficient multi-skilled team composition
- On a multi-project staffing problem with heterogeneously skilled workers
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills
- Cross-Utilization of Workers Whose Capabilities Differ
This page was built for publication: Stable multi-skill workforce assignments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744637)
