Modelos y algoritmos de secuenciación en líneas de ensamble de productos mixtos

• Autores: Jaime Cano Belman
• Directores de la Tesis: Joaquín Bautista Valhondo (dir. tes.)
• Lectura: En la Universitat Politècnica de Catalunya (UPC) ( España ) en 2006
• Idioma: español
• Tribunal Calificador de la Tesis: Josep Casanovas Garcia (presid.) , Jaume Barceló Bugeda (secret.) , Sebastián Lozano Segura (voc.) , Daniel Serra de la Figuera (voc.) , Lluís Cuatrecasas Arbós (voc.)
• Texto completo no disponible (Saber más ...)
• Resumen

  • The object of this thesis is the Mixed-model Assembly-line Sequencing problem, Assembly lines have become a core component in modern repetitive manufacturing systems, especially in Just in Time production systems. Sequencing problems are important for the efficient use of mixed-model assembly lines. The sequencing for such lines entails the determination of the order in which the products are to be assembled in the line, in relation to specific criteria. In this work, load leveling is considered to be the sequencing criteria. Various objectives have been considered by researchers to measure leveling of the load. The objective used depends on the company management policies and on the productive system constraints. The main sequencing objective is to minimize the work overload. Work overload can be understood as the work which would not be completed if the assembler were to work at a normal pace and stay within the boundaries of the station. The problem is studied assuming paced line, closed stations, deterministic processing times, fixed launching, and operator schedule has an early start. Due to the computational effort required for optimally solving the problem, three different heuristic methodologies are explored in this thesis: constructive procedures (CP), local search and the combination of priority rules and neighborhood search. Concerning the CP, three algorithms are taken from literature. These procedures consider one station and two kinds of products . Two procedures are proposed for this problem. One of them is greedy (Ud1). The other (Ud2) is based in the fact that prior values of compulsory work overload and idle time can be obtained and can be used to guide previously existing procedures. Five procedures are compared in two computational experiments. In experiment one, procedures are compared on a testbed of 750 instances with single station. Multiple stations are considered in experiment two with 2250 instances . With regards to the single station pro