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

Motivated by baterryless IoT devices, we consider the following schedulingproblem. The input includes $n$ unit time jobs $\mathcal{J} = \{J_1, \ldots,J_n\}$, where each job $J_i$ has a release time $r_i$, due date $d_i$, energyrequirement $e_i$, and weight $w_i$. We consider time to be slotted; hence, alltime related job values refer to slots. Let $T=\max_i\{d_i\}$. The input alsoincludes an $h_t$ value for every time slot $t$ ($1 \leq t \leq T$), which isthe energy harvestable on that slot. Energy is harvested at time slots when nojob is executed. The objective is to find a feasible schedule that maximizesthe weight of the scheduled jobs. A schedule is feasible if for every job $J_j$in the schedule and its corresponding slot $t_j$, $t_{j} \neq t_{j'}$ if ${j}\neq {j'}$, $r_j \leq t_j \leq d_j$, and the available energy before $t_j$ isat least $e_j$. To the best of our knowledge, we are the first to consider thetheoretical aspects of this problem.  In this work we show the following. (1) A polynomial time algorithm when alljobs have identical $r_i, d_i$ and $w_i$. (2) A $\frac{1}{2}$-approximationalgorithm when all jobs have identical $w_i$ but arbitrary $r_i$ and $d_i$. (3)An FPTAS when all jobs have identical $r_i$ and $d_i$ but arbitrary $w_i$. (4)Reductions showing that all the variants of the problem in which at least oneof the attributes $r_i$, $d_i$, or $w_i$ are not identical for all jobs areNP-Hard.

Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput