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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In this paper, we consider the slack due-window assignment model and study asingle machine scheduling problem of linear time-dependent deteriorating jobsand a deteriorating maintenance activity. The cost for each job consists offour components: earliness, tardiness, window location and window size. Theobjective is to schedule the jobs and to assign the maintenance activity anddue-windows such that the total cost among all the jobs is minimized. Apolynomial-time algorithm with the running time not exceeding $O(n^2logn)$ togive a solution to this problem is introduced, where $n$ is the number of jobs.

Single machine slack due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity