Tesis

Development and Validation of Novel Optimization Approaches to Solve the Flexible Job-Shop Scheduling Problem = Desarrollo y validación de nuevos enfoques de optimización para solucionar el problema de ordenamiento de tipo Job-shop flexible

CONTENIDO DE LIBRE ACCESO

Este contenido es de libre acceso. Solo haz clic en el siguiente botón.

Autor
Año de publicación 2016
Idioma Inglés

Descripción: The classical job-shop problem is among the most studied scheduling models because it can model a variety of real-life applications. This problem can be reinforced by integrating the operation flexibility to obtain a more realistic model, called Flexible-Job shop Scheduling Problem (FJSP), that capture the salient features of modern systems. To consider both productivity and customer service in the FJSP, objective function such as regular criteria that consider an increasing function of the completion times of the jobs are needed. Makespan consists of minimizing the maximal completion time of all jobs, and it is the most studied criterion in the FJSP. However, minimizing other regular criteria are better suited to capture critical factors that affect the profit of manufacturing and service systems and thus their competitiveness; in particular the importance of jobs(customers) with weighted criteria. This thesis presents innovative general local search approaches to minimize regular criteria in the FJSP in two ways: Single criterion and multi-criteria called Multi-Objective Flexible Job-shop Scheduling Problem (MOFJSP). The local search approaches make use of a generalization of the disjunctive graph model, iteratively progress from one solution to another using two neighborhood structures (N1 and N2). N1 consists of moving all critical operations that belong to critical paths of jobs which affect the criterion being optimized and N2 is a subset of N1 where only operations which belong to blocks. New, efficient and fast sufficient feasibility conditions to obtain moves of the neighborhoods and evaluation functions that assess the quality of the feasible moves are proposed.
Citación recomendada (normas APA)
: Andrés Alberto García León, "Development and Validation of Novel Optimization Approaches to Solve the Flexible Job-Shop Scheduling Problem = Desarrollo y validación de nuevos enfoques de optimización para solucionar el problema de ordenamiento de tipo Job-shop flexible", -:-, 2016. Consultado en línea en la Biblioteca Digital de Bogotá (https://www.bibliotecadigitaldebogota.gov.co/resources/2089265/), el día 2025-05-18.

Información adicional

Temas
- Otros
Derechos de uso Derechos reservados
Fuente Biblioteca Virtual Banco de la República
Términos y condiciones de uso Más información aquí
Año de publicación 2016
Formato PDF

Development and Validation of Novel Optimization Approaches to Solve the Flexible Job-Shop Scheduling Problem = Desarrollo y validación de nuevos enfoques de optimización para solucionar el problema de ordenamiento de tipo Job-shop flexible

Información adicional

Mis colecciones

¿Eliminar esta reseña?