TESIS-MAG-0201.pdf

[Hendler 901 HENDLER, J., TATE, A. y DRUMMOND, M. (1990) Al planning:
system and techniques. Al Magazine, Vol. 11, 6 1-77.
[Hoon Lee 91] HOON LEE, Y. H., BHASKARAN,K. y P1NEDO, M. (1993) A
138
heuristic to minimize the total weighted tardiness with sequence-dependent
setups. Technical Report. Department of Industrial Engineering and
Operational Research, Columbia University, Nueva York.
[Kirkpatrick 831 KIRKPATRICK, S., GELATT, J. R., y VECCHI, M.P. (1983)
Optimization by Simulated Annealing. Science 220, 671-680.
[Kumar 921 KUMAR,V., Algorithms for constraint-satisfaction problems: a survey. Al
Magazine, Vol. 13, 32-44.
[Lawler 93] LAWLER, E. L., LENSTRA, J.K., RNNOOY KAN, A. H. G y SHMOYS,
D.B. (1993) Sequencing and scheduling: algorithms and complexity. En S.S
Graves, A.h.g Rinnooy Kan y P.Zipkin (eds.), Handbooks in Operations
Research and Management Science. North-Holland, Nueva York.
[Levys 93] LEVYS, P. (1993) Modelación Basada en Conocimiento para Resolver
Problemas de Planificación y Asignación de Recursos. Tesis de Magister,
Departamento de Ciencia de la Computación, Pontificia Universidad
Católica de Chile.
[Lourenço 95] LOURENÇO, H.. (1995) Job shop scheduling : computational study of
local search optimization methods. European Journal of Operational
Research, Vol. 83, 347-364.
[Melero 941 MELERO, M. (1994) Rediseño y Programación de la Base de
Conocimiento de Visiplan. Memoria de Título, Departamento de Ciencia de
la Computación, Pontificia Universidad Católica de Chile.