Empreu aquest identificador per citar o enllaçar aquest ítem:
http://hdl.handle.net/10609/143406
Títol: | A biased-randomized discrete-event algorithm for the hybrid flow shop problem with time dependencies and priority constraints |
Autoria: | Copado Mendez, Pedro Jesus Panadero Martínez, Javier Laroque, Christoph Leißau, Madlene Schumacher, Christin Juan, Angel A. |
Altres: | University of Applied Sciences Zwickau Universitat Oberta de Catalunya TU Dortmund University Universitat Politècnica de València |
Citació: | 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 |
Resum: | 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. |
Paraules clau: | programació de màquines heurística d'events discrets aleatorització processament per lots prioritat taller de flux híbrid |
DOI: | https://doi.org/10.3390/a15020054 |
Tipus de document: | info:eu-repo/semantics/article |
Versió del document: | info:eu-repo/semantics/publishedVersion |
Data de publicació: | 2-feb-2022 |
Apareix a les col·leccions: | Articles cientÍfics Articles cientÍfIcs |
Arxius per aquest ítem:
Arxiu | Descripció | Mida | Format | |
---|---|---|---|---|
algorithms-15-00054-v2.pdf | 294,99 kB | Adobe PDF | Veure/Obrir |
Comparteix:
Aquest ítem està subjecte a una llicència de Creative Commons Llicència Creative Commons