English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

espanolEn este estudio se propone e implementa computacionalmente un algoritmo genetico secuencial para resolver el problema del Job Shop Flexible (existente en la Gestion de Operaciones), el cual es parte de la familia de los problemas de programacion de tareas o trabajos (Scheduling) en un taller que funciona a pedido. Surge como una generalizacion del problema del Job Shop y permite optimizar el uso de los recursos (maquinas) con mayor flexibilidad, ya que cada maquina puede realizar mas de una operacion. Este problema ha sido estudiado por numerosos autores, los que han propuesto diversos modelos matematicos y enfoques heuristicos. Debido a la naturaleza combinatoria, los metodos exactos que resuelven modelos matematicos encuentran soluciones solo para instancias pequenas o simples del problema mencionado. Los resultados muestran la efectividad del algoritmo propuesto para entregar buenas soluciones en tiempos computacionales razonables en mas de 130 instancias encontradas en la literatura. EnglishThis study proposes and computationally implements a sequential genetic algorithm to solve the Flexible Job Shop problem (found in Operations Management), which is part of the family of job or task scheduling problems in a shop that works on demand. It is a generalization of the Job Shop problem, and allows optimizing the use of resources (machines) in the shop, with greater flexibility, since each machine can perform more than one operation. This problem has been studied by many authors, who have proposed various mathematical models and heuristic approaches. Due to the combinatorial nature of the problem, the exact methods that solve the mathematical models are often solutions for small and simple instances of the problem. The results show the effectiveness of the proposed algorithm to provide good solutions in reasonable computational times in over 130 instances found in the literatura.

Un algoritmo genético para el problema de Job Shop Flexible