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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we consider an NP-hard problem of scheduling a set of jobs ofequal processing time on two machines, given a partial precedence order on theset of jobs, with an objective to minimize the makespan. An approximationalgorithm is proposed for this problem with a tight approximation bound.Polynomial solvability of the problem is proved in the case when each job onthe first machine is in precedence relation with two jobs on the secondmachine.

Analysis of Scheduling Problem on Two Machines with Partial Precedence Order on the Set of Jobs