4 research outputs found

    A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation

    Get PDF
    [EN] The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many production scheduling problems resemble flowshops and hence it has generated much interest and had a big impact in the field, resulting in literally hundreds of heuristic and metaheuristic methods over the last 60 years. However, most methods proposed for makespan minimisation are not properly compared with existing procedures so currently it is not possible to know which are the most efficient methods for the problem regarding the quality of the solutions obtained and the computational effort required. In this paper, we identify and exhaustively compare the best existing heuristics and metaheuristics so the state-of-the-art regarding approximate procedures for this relevant problem is established. (C) 2016 Elsevier B.V. All rights reserved.The authors are sincerely grateful to the anonymous referees, who provide very valuable comments on the earlier version of the paper. This research has been funded by the Spanish Ministry of Science and Innovation, under projects "ADDRESS" (DPI2013-44461-P/DPI) and "SCHEYARD" (DPI2015-65895-R) co-financed by FEDER funds.Fernandez-Viagas, V.; Ruiz García, R.; Framinan, J. (2017). A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. European Journal of Operational Research. 257(3):707-721. https://doi.org/10.1016/j.ejor.2016.09.055S707721257

    Design and analysis of algorithms for solving a class of routing shop scheduling problems

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Mejora de tiempos de entrega en un flow shop híbrido flexible usando técnicas inteligentes. Aplicación en la industria de tejidos técnicos

    Get PDF
    Se busca aportar herramientas útiles para la programación de producción en la industria de tejidos técnicos. Se parte de las condiciones actuales de la programación de producción en este tipo de industria y de los antecedentes en la literatura científica sobre modelos aplicables a estos entornos. Se propone un modelo de solución por técnicas inteligentes a la problemática de la secuenciación y asignación de tareas en los entornos flow shop híbrido flexible considerando situaciones como: paralelismo entre máquinas no relacionadas, tiempos de montaje dependientes de la secuencia, entrada dinámica de trabajos, restricción de elegibilidad, maleabilidad y lotes de transferencia variables entre etapas. De allí se construye la propuesta de solución que involucra simultáneamente todas las condiciones de entorno real mencionadas y aplica un algoritmo genético modificado de acuerdo a las características del problema. Se concluye que el modelado considerando condiciones realistas es posible, que los algoritmos genéticos son una opción práctica para entornos reales y que las empresas pueden obtener mejoras en su capacidad de respuesta con este tipo de solucionesAbstract : It seeks to provide useful tools for production scheduling in the technical textiles industry. It begins in the current conditions of production scheduling in this type of industry and the background in scientific literature, applicable to these environments models. The mathematical model to solve the problem of sequencing and assigning jobs in Flexible hybrid flow shop environments is developed considering: unrelated parallel machines, sequence dependent setup time, dynamic entry of jobs, availability constrain, malleability and variable transfer batches between stages. The solution proposal is build including all actual environment features considered together and applying a modified genetic algorithm modeled according to the problem. It is concluded that the model of scheduling problems considering realistic conditions is possible, that genetic algorithms are a practical option for real environments, and that companies can achieve improvements in their responsiveness with this kind of solutionsDoctorad
    corecore