Por favor, use este identificador para citar o enlazar este ítem:
https://rinacional.tecnm.mx/jspui/handle/TecNM/3003| Título : | ALGORITMO HÍBRIDO PARA EL PROBLEMA DINÁMICO DE CALENDARIZACIÓN DE TAREAS (DYNAMIC JOB SHOP SCHEDULING PROBLEM) |
| Autor : | Lizardi Duran, Arsenio De Jesus. |
| Fecha de publicación : | 2021-12-01 |
| Editorial : | Tecnológico Nacional de México |
| metadata.dc.publisher.tecnm: | Instituto Tecnológico de Ciudad Madero |
| Descripción : | The Job Shop Scheduling Problem (JSSP) is an NP-hard problem where the application of exact methods has limitations. Numerous methods based on metaheuristics have been developed to solve the JSSP problem, but there are few works dedicated to solving the Dynamic Job Shop Scheduling Problem (DJSSP), which models the unexpected events that occur in real-world manufacturing systems. In this thesis, we address DJSSP with three types of dynamic events: machine breakdowns, new job arrivals, and changes in the processing time; with a hybrid algorithm based on simulated annealing and a local search strategy. This algorithm is evaluated using a set of benchmark instances and experimentation is performed to compare the performance of the developed algorithm with those reported in the literature. The numerical results obtained indicate that the proposed method produces better solutions for the benchmark instances, compared with the methods reported on the literature |
| metadata.dc.type: | info:eu-repo/semantics/masterThesis |
| Aparece en las colecciones: | Maestría en Ciencias de la Computación |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| G13071650_donacion_tesis_bib.pdf | 914.63 kB | Adobe PDF | Visualizar/Abrir | |
| G13071650_donacion_tesis_licencia.pdf Until 2050-01-01 | 127.09 kB | Adobe PDF | Visualizar/Abrir Request a copy |
Este ítem está protegido por copyright original |
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons
