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

In this paper, we show that the strong NP-hardness proofs of some scheduling problems with start time dependent job processing times presented in Gawiejnowicz (Eur J Oper Res 180:472–478, 2007) and Zhao and Tang (Optim Lett 5:183–190, 2011) are incorrect. Namely, the applied transformations from 4-Product problem to the considered scheduling problems are polynomial not pseudopolynomial. Thus, the related problems are NP-hard, but their complete computational status is still an open issue: ordinary or strongly NP-hard?

A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times