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

In this paper a class of single machine scheduling problems is considered. Itis assumed that job processing times and due dates can be uncertain and theyare specified in the form of discrete scenario set. A probability distributionin the scenario set is known. In order to choose a schedule some risk criteriasuch as the value at risk (VaR) an conditional value at risk (CVaR) are used.Various positive and negative complexity results are provided for basic singlemachine scheduling problems. In this paper new complexity results are shown andsome known complexity results are strengthen.

Risk averse single machine scheduling - complexity and approximation