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

Scheduling problems are NP-hard, thus have few alternative methods for obtaining solutions. Genetic algorithms have been used to solve scheduling problems; however, the application of genetic algorithms are too expectant, as the steps involved in a genetic algorithm, especially the reproduction step and the selection step, are often time-consuming and computationally expensive. This is because the newly reproduced chromosomes are often redundant or invalid. This paper proposes a brute-force approach for solving scheduling problems, as an alternative to genetic algorithm; the proposed approach is based on Activity-oriented Petri nets (AOPN) and is computationally simple; in addition, the proposed approach also provides the optimal solution as it scans the whole workspace, whereas genetic algorithm does not guarantee optimal solution.

Outperforming Genetic Algorithm with a Brute Force Approach Based on Activity-Oriented Petri Nets