Problemas de Scheduling: heurísticas para el Job Shop
Archivos
Fecha
2007-07-02
Autores
Medrano Broche, Bolívar Ernesto
Título de la revista
ISSN de la revista
Título del volumen
Editor
Universidad Central “Marta Abreu” de Las Villas
Resumen
Este trabajo se ha realizado con la idea de que sirva como texto para la introducción a
la teoría de problemas de Scheduling y sus métodos de solución. Exponemos las
características principales de los problemas de Scheduling y se realiza una descripción
detallada del Job Shop Scheduling Problem. También exponemos algunos métodos de
solución para problemas de Scheduling como el Recocido Simulado y SB así como
operadores de transición para ser utilizados por las Metaheurísticas de búsqueda local.
Además presentamos el uso de la simulación para la implementación de heurísticas
simples, proponemos e implementamos una nueva heurística (HBM) para JSSP. Se
presentan los resultados de la nueva heurística y se compara con otras reglas simples de
despacho en más de 80 problemas de prueba. Finalmente se proponen cursos sobre el
tema de Scheduling para ser impartidos en la carrera de Licenciatura en Matemática
aunque extensible a otras carreras.
This work has been done with the idea of presenting an introductory book to the theory of Scheduling problems and its solution methods. We describe the main characteristics of the Scheduling problems and present a detailed description of the Job shop Scheduling problem (JSSP). We also describe some general solution methods for the Scheduling problem such as Simulated Annealing and Shifting Bottleneck. Some transition operators are described that can be used by the local search Metaheuristics. Furthermore, we present the use of simulation in order to implement simple heuristics and propose a new heuristic (HBM) for the JSSP. We present the results of the new heuristic and compare it with other simple heuristics in more than 80 test problems. Finally, we propose some curses about Scheduling for the Mathematic studies, although it can be extended to other studies as well.
This work has been done with the idea of presenting an introductory book to the theory of Scheduling problems and its solution methods. We describe the main characteristics of the Scheduling problems and present a detailed description of the Job shop Scheduling problem (JSSP). We also describe some general solution methods for the Scheduling problem such as Simulated Annealing and Shifting Bottleneck. Some transition operators are described that can be used by the local search Metaheuristics. Furthermore, we present the use of simulation in order to implement simple heuristics and propose a new heuristic (HBM) for the JSSP. We present the results of the new heuristic and compare it with other simple heuristics in more than 80 test problems. Finally, we propose some curses about Scheduling for the Mathematic studies, although it can be extended to other studies as well.
Descripción
Palabras clave
Problemas de Schedulin, Heurísticas, Job Shop