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

We consider a competitive two-agent scheduling problem on multiple identical machines with release dates and preemption. In the scheduling model, there are two agents  and  each having their own job sets  and , respectively. Each job  has a release date  and the  jobs need to be preemptively scheduled on  identical machines. For , we show that the trade-off curve of all the Pareto optimal points can be characterized in polynomial time. When  is input, we show that  can be solved in strongly polynomial time

A Competitive Two-Agent Scheduling Problem on Parallel Machines with Release Dates and Preemption