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 system for an expatriate assignment needs an effective and efficient way to be designed since the expatriates reside outside their countries to do their assignments in very limited time. The problem of this scheduling system is quite complicated as the expatriates usually work in a team to do more than one assignment in some divisions. This situation leads to the frequent clash of schedules. In this paper, an algorithm for scheduling system was developed to optimize the expatriate assignment. The methods used for developing the algorithms was vertex coloring of graph. This algorithm resulted in the optimal number of colors which is equivalent to the optimal time allocated for the expatriate assignment without any clash schedule among expatriates. The algorithm can be used for designing a software or application for scheduling system.

Scheduling algorithms for an expatriate assignment using vertex coloring of graph