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

In this paper, harmony search algorithm is applied to curriculum-based coursetimetabling. The implementation, specifically the process of improvisationconsists of memory consideration, random consideration and pitch adjustment. Inmemory consideration, the value of the course number for new solution wasselected from all other course number located in the same column of the HarmonyMemory. This research used the highest occurrence of the course number to bescheduled in a new harmony. The remaining courses that have not been scheduledby memory consideration will go through random consideration, i.e. will selectany feasible location available to be scheduled in the new harmony solution.Each course scheduled out of memory consideration is examined as to whether itshould be pitch adjusted with probability of eight procedures. However, thealgorithm produced results that were not comparatively better than thosepreviously known as best solution. With proper modification in terms of theapproach in this algorithm would make the algorithm perform better oncurriculum-based course timetabling.

Harmony Search Algorithm for Curriculum-Based Course Timetabling Problem