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

This article addresses the problem of total weighted delay in a machine, known as Single Machine Total Weighted Tardiness (SMTWT) for its acronym in English, recognized in the literature as a NP-hard problem due to its computational complexity. For its solution, a Greedy Randomized Adaptive Search Procedure (GRASP) algorithm is proposed with an integration strategy of 2-opt and inversion diversification operators, whose objective is to minimize costs through finding an effective order of tasks addressed in each machine. We used the OR-Library library with problems of 40, 50 and 100 tasks with 125 instances each. The proposed algorithm obtained for the total of analyzed cases values that on average had a 6.5% error with respect to the best known values and in approximately 15% of the cases better solutions were found than those reported in the literature.

Propuesta de algoritmo GRASP para el problema de la tardanza total ponderada en una máquina