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

The paper proposes a genetic algorithm to solve optimally the problem of scheduling in a multi-objective production system Flexible Job Shop (FJS), currently of interest for many researchers, because it is a combinatorial optimization problem of complexity NP-hard, and because an optimal solution results in an increase in production. the problem is divided, in the subproblem routing, where it is assigned to each operation of Jobs, one of the most optimum machines (from a set available) minimizing Maximum Workload, and Total Workload and subproblem sequencing, where it is found the optimal order of execution of operations (distributed on each machine) minimizing the Makespan. The algorithm is coded in Matlab M language, their performance is tested, solving complex problems, and the results are compared with those obtained by other researchers.

Enrutamiento y secuenciación óptimos en un flexible job shop multiobjetivo mediante algoritmos genéticos