A graph colouring model for assigning a heterogeneous workforce to a given schedule
From MaRDI portal
Publication:1266545
DOI10.1016/0377-2217(95)00355-XzbMath0916.90158OpenAlexW1998590057MaRDI QIDQ1266545
Vicente Valls, Ángeles Pérez, M. Sacramento Quintanilla
Publication date: 27 July 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00355-x
Related Items
A heuristic approach to project staffing ⋮ Work assignment to and qualification of multi-skilled human resources under knowledge depreciation and company skill level targets ⋮ Scheduling and staffing multiple projects with a multi-skilled workforce ⋮ Minimizing average project team size given multi-skilled workers with heterogeneous skill levels ⋮ Algorithms for large scale shift minimisation personnel task scheduling problems ⋮ A successful three-phase metaheuristic for the shift minimization personal task scheduling problem ⋮ Pre-processing techniques for resource allocation in the heterogeneous case
Cites Work
- An introduction to timetabling
- Scheduling jobs with fixed start and end times
- Some results concerning the complexity of restricted colorings of graphs
- An Optimal Solution for the Channel-Assignment Problem
- Minimal Resources for Fixed and Variable Job Schedules
- Graph coloring conditions for the existence of solutions to the timetable problem
- Chromatic Scheduling and the Chromatic Number Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item