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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Negatively answering a question posed by Mnich and Wiese (Math. Program.154(1-2):533-562), we show that P2|prec,$p_j{\in}\{1,2\}$|$C_{\max}$, theproblem of finding a non-preemptive minimum-makespan schedule forprecedence-constrained jobs of lengths 1 and 2 on two parallel identicalmachines, is W[2]-hard parameterized by the width of the partial order givingthe precedence constraints. To this end, we show that Shuffle Product, theproblem of deciding whether a given word can be obtained by interleaving theletters of $k$ other given words, is W[2]-hard parameterized by $k$, thusadditionally answering a question posed by Rizzi and Vialette (CSR 2013).Finally, refining a geometric algorithm due to Servakh (Diskretn. Anal. Issled.Oper. 7(1):75-82), we show that the more general Resource-Constrained ProjectScheduling problem is fixed-parameter tractable parameterized by the partialorder width combined with the maximum allowed difference between the earliestpossible and factual starting time of a job.

Precedence-constrained scheduling problems parameterized by partial order width