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

A parallel-machine scheduling problem with tree-formed pr ecedence constraints is studied, where jobprocessing times can be compressed by allocating extra reso urce to the jobs. A tabu-search algorithm is developed in this paper, which searches for the near optimal solutions based on the structural characteristics of the problem. Experiment shows the algorithm is capable fo r pr viding satisfactory schedules for media and large-sized problems within acceptable computing time.

Parallel-machine Scheduling with Precedence Constraints and Controllable Job-processing Times