Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10609/143406
Título : A biased-randomized discrete-event algorithm for the hybrid flow shop problem with time dependencies and priority constraints
Autoría: Copado Mendez, Pedro Jesus  
Panadero Martínez, Javier
Laroque, Christoph
Leißau, Madlene
Schumacher, Christin
Juan, Angel A.  
Otros: University of Applied Sciences Zwickau
Universitat Oberta de Catalunya
TU Dortmund University
Universitat Politècnica de València
Citación : Laroque, C., Leißau, M., Copado Méndez, P., Schumacher, C., Panadero, J. & Juan Perez, A.A. (2022). A Biased-Randomized Discrete-Event Algorithm for the Hybrid Flow Shop Problem with Time Dependencies and Priority Constraints. Algorithms, 15(2), 1-14. doi: 10.3390/a15020054
Resumen : Based on a real-world application in the semiconductor industry, this article models and discusses a hybrid flow shop problem with time dependencies and priority constraints. The analyzed problem considers a production where a large number of heterogeneous jobs are processed by a number of machines. The route that each job has to follow depends upon its type, and, in addition, some machines require that a number of jobs are combined in batches before starting their processing. The hybrid flow model is also subject to a global priority rule and a ¿same setup¿ rule. The primary goal of this study was to find a solution set (permutation of jobs) that minimizes the production makespan. While simulation models are frequently employed to model these time-dependent flow shop systems, an optimization component is needed in order to generate high-quality solution sets. In this study, a novel algorithm is proposed to deal with the complexity of the underlying system. Our algorithm combines biased-randomization techniques with a discrete-event heuristic, which allows us to model dependencies caused by batching and different paths of jobs efficiently in a near-natural way. As shown in a series of numerical experiments, the proposed simulation-optimization algorithm can find solutions that significantly outperform those provided by employing state-of-the-art simulation software.
Palabras clave : programación de maquinas
heurística de eventos discretos
aleatorización
procesamiento por lotes
prioridad
taller de flujo híbrido
DOI: https://doi.org/10.3390/a15020054
Tipo de documento: info:eu-repo/semantics/article
eu-repo/semantics/publishedVersion
Fecha de publicación : 2-feb-2022
Aparece en las colecciones: Articles cientÍfics
Articles cientÍfIcs

Ficheros en este ítem:
Fichero Descripción Tamaño Formato  
algorithms-15-00054-v2.pdf294,99 kBAdobe PDFVista previa
Visualizar/Abrir