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 consider the problem of minimizing makespan of n deteriorating jobs on a single machine. Rates of deterioration are job-dependent and constant with respect to the starting times. Jobs begin to deteriorate after a common critical date ‘d.’ The concept of relaxed agreeable weights is introduced. It is shown that the problem is NP-hard. The condition of relaxed agreeable weights and the structure of the problem are used to show that our local search algorithm, to obtain a locally optimal solution, will require polynomial effort in the number of jobs.

A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights