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/

Zendy Plus

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

Zendy Tools

Zendy Open

We consider online preemptive scheduling of jobs arriving one by one, to beassigned to two identical machines, with the goal of makespan minimization. Westudy the effect of selecting the best solution out of two independentsolutions constructed in parallel in an online fashion. Two cases are analyzed,where one case is purely online, and in the other one jobs are presented sortedby non-increasing sizes. We show that using two solutions rather than oneimproves the performance significantly, but that an optimal solution cannot beobtained for any constant number of solutions constructed in parallel. Ouralgorithms have the best possible competitive ratios out of algorithms for eachone of the classes.

Parallel solutions for preemptive makespan scheduling on two identical machines