A graph colouring model for assigning a heterogeneous workforce to a given schedule

European Journal of Operational Research

Volumn 90, Issue 2, 1996, Pages 285-302

  Valls, Vicente ^a   Ferez, Angeles ^a   Quintanilla, Sacramento ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Branch and bound; Graph colouring; Resource allocation; Workforce assignment

Indexed keywords

ALGORITHMS; GRAPH THEORY; MACHINERY; MATHEMATICAL MODELS; OPTIMIZATION; PERSONNEL; SCHEDULING;

BRANCH AND BOUND; GRAPH COLOURING; WORKFORCE ASSIGNMENT;

RESOURCE ALLOCATION;

EID: 0030122628     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00355-X     Document Type: Article

References (16)

1. Arkin, M., and Silverberg, B. (1987), "Scheduling jobs with fixed start and end times", Discrete Applied Mathematics, 18.
2. Brooks, R.L. (1941), "On colouring the nodes of a network", Proceedings of the Cambridge Philosophical Society, 37.
3. Brown, J.L. (1972), "Chromatic scheduling and the chromatic number problem", Management Science, 19.
4. Christofides, N. (1975), Graph Theory. An Algorithmic Approach, Academic Press, New York.
5. de Werra, D. (1985), "An introduction to timetabling", European Journal of Operational Research, 19.
6. Ford, L.R., and Fulkerson, D.R. (1962), Flows in Networks, Princeton University Press, Princeton, NJ, 64-67.
7. Garey, M., and Johnson, D. (1979), Computer and Intractability. A Guide to the Theory of NP-Completeness, W.H. Freeman and Company.
8. Gersbakh, I., and Stern, H., (1978), "Minimal resources for fixed and variable job schedules", Operations Research, 26.
9. Golumbic, M.C. (1980), Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York.
10. Gupta, U., Lee, D., and Leung, Y. (1979), "An optimal solution for the channel assignment problem", IEEE Transactions on Computing 28.
11. Hammer, P.L., and Rudeanu, S. (1968), Boolean Methods in Operations Research, Springer-Verlag, Berlin, 1968.
12. Korman, S. (1979), "The graph colouring problem", in: N. Christofides, A. Mingozzi, P. Toth and C. Sandi (eds). Combinatorial Optimization, Wiley, New York.
13. Kubale, M. (1992), "Some results concerning the complexity of restricted colorings of graphs", Discrete Applied Mathematics 36.
14. Neufeld, G., and Tartar, J. (1974), "Graph coloring conditions for the existence of solutions to the timetable problem", Communications of the ACM 17.
15. Quintanilla, M.S. (1994), "Técnicas exactas y heurísticas para la asignación de una plantilla de trabajadores a una planificación establecida", Ph.D. Thesis, Departamento de Estadística e Investigación Operativa, Universidad de Valencia, Spain.
16. Zykov, A.A. (1952), "On some properties of linear complexes", Amer. Math. Soc., Translation 79.