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

F. Tang School. of Industry Hunan Normal University Changsha 410081, China J. Nie Dept. of Math Hunan Normal University Changsha 410081, China Abstract—In this paper, semi-online scheduling jobs with nondecreasing release times and non-increasing processing times on m identical parallel machines is considered. The aim is to minimize the last completion time of all machines. It is proved that, for any m identical parallel machines, 3/2-1/2m is an upper bound of the worst case performance ratio of List Scheduling(LS) algorithm.

LS Algorithm for Semi-online Scheduling Jobs with Nondecreasing Release Times and Nondecreasing Processing Times