Por favor, use este identificador para citar o enlazar este ítem: http://comimsa.repositorioinstitucional.mx/jspui/handle/1022/391
EXPLORATION OF OPTIMIZATION TECHNIQUES FOR THE MACHINE SEQUENCE PLANNING (OPEN SHOP AND JOB SHOP) WITH MULTIPLE PRECEDENCES: A REAL SCENARIO
Pedro Pérez Villanueva
Acceso Abierto
Atribución-NoComercial-SinDerivadas
OPEN SHOP AND JOB SHOP
This paper presents the application of common heuristics, random search and evolutionary algorithms with representation of random keys and permutations in order to compare as techniques of optimization for the machine sequence planning in a real scenario considering multiples precedence. The results indicate a compromise that the user must take between the quality of the solution and the processing time.
2008-10
Artículo
Inglés
Estudiantes
Investigadores
EXPLORATION OF OPTIMIZATION TECHNIQUES FOR THE MACHINE SEQUENCE PLANNING (OPEN SHOP AND JOB SHOP) WITH MULTIPLE PRECEDENCES: A REAL SCENARIO Javier Alejandro Herrera-Zamora1, Luís M. Torres-Treviño, and Pedro Pérez-Villanueva. Proceedings of the 13th Annual International Conference on Industrial Engineering Theory, Applications and Practice Las Vegas, Nevada September 7-10, 2008
INGENIERÍA Y TECNOLOGÍA
Versión publicada
publishedVersion - Versión publicada
Aparece en las colecciones: ARTÍCULOS/ CAPÍTULOS DE LIBRO / MEMORIAS DE CONGRESO

Cargar archivos:


Fichero Descripción Tamaño Formato  
2008-EXPLORATION OF.pdfProceedings of the 13th Annual International Conference on Industrial Engineering Theory, Applications and Practice Las Vegas, Nevada September 7-10, 2008211.95 kBAdobe PDFVisualizar/Abrir