Pre-processing techniques for resource allocation in the heterogeneous case

European Journal of Operational Research

Volumn 107, Issue 2, 1998, Pages 470-491

  Valls, Vicente ^a   Perez, M Angeles ^a   Quintanilla, M Sacramento ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Macroactivities; Preprocessing; Resource allocation

Indexed keywords

COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

HETEROGENEOUS RESOURCE ALLOCATION PROBLEM (HRAP);

PRODUCTION ENGINEERING;

EID: 0032097625     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00340-8     Document Type: Article

References (20)

1. Arkin, M., Silverberg, B., 1987. Scheduling jobs with fixed start and end times. Discrete Applied Mathematics 18, 1-8.
2. Baker, D., 1974. Scheduling a full-time workforce to meet cyclic staffing requirements. Management Science 20 (12), 1561-1568.
3. Bechtold, S., Brusco, M., Showalker, M., 1991. A comparative evaluation of labor tour scheduling methods. Decision Science 22, 683-699.
4. Brittan, J., Farley, F., 1971. College timetable construction by computer. The Computer Journal 14 (4), 361-365.
5. de Werra, D., 1971. Construction of school timetables by flow methods. Infor 9 (1), 12-22.
6. de Werra, D., 1985. An introduction to timetabling. European Journal of Operational Research 19, 151-162.
7. Defrenne, A., 1978. The timetabling problem: A survey. Cahiers Centre Etud. Resh. Oper 20 (2), 163-169.
8. Fischetti, M., Martello, S., Toth, P., 1987. The fixed job schedule problem with spread-time constraints. Operations Research 37 (3), 395-403.
9. Ford, L.R., Fulkerson, D.R., 1962. Flows in Networks, Princeton University Press, pp. 64-67.
10. Korman, S., 1979. The graph colouring problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (Eds.), Combinatorial Optimization, Wiley, New York, pp. 211-235.
11. Li, C., Robinson, E., Mabert, V., 1991. An evaluation of tour scheduling heuristics with differences in employee productivity and cost. Decision Sciences 22, 700-718.
12. Loucks, J., Jacobs, F., 1991. Tour scheduling and task assignment of a heterogeneous work force: A heuristic approach. Decision Sciences 22, 719-738.
13. Marsten, R., Muller, M., Killion, C., 1979. Crew planning at flying tiger: A successful application of integer programming. Management Science 25 (12), 1175-1183.
14. Morris, J., Showalker, M., 1983. Simple approaches to shift, days-off and tour scheduling problems. Management Science 29 (8), 942-950.
15. Neufeld, G., Tartar, J., 1974. Graph coloring conditions for the existence of solutions to the timetable problem. Communications of the ACM 17 (8), 450-453.
16. 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 Estadistica e Investigación Opertiva, Universidad de Valencia, Spain.
17. Ritzman, L., Krajewski, L., Showalter, J., 1976. The disaggregation of aggregate manpower plans. Management Science 22 (11), 1204-1214.
18. Ruhe, G., 1991. Algorithmic Aspects of Flows in Networks. Kluwer Academic Publishers, pp. 174-184.
19. Valls, V., Pérez, M.A., Quintanilla, M.S., 1996a. A graph colouring model for assigning a heterogeneous workforce to a given schedule. European Journal of Operational Research 90, 285-302.
20. Valls, V., Pérez, M.A., Quintanilla, M.S., 1996b. A modified tabu thresholding approach for the generalised restricted vertex colouring problem. In: Osman, I.H., Kelly, J.P. (Eds.), Metaheuristic Theory and Applications. Kluwer Academic Publishers, pp. 537-553.