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

We consider a set of transmitter-receiver pairs, or links, that share acommon channel and address the problem of emptying backlogged queues at thetransmitters in minimum time. The problem amounts to determining activationsubsets of links and their time durations to form a minimum-length schedule.The problem of scheduling has been studied under various formulations before.In this paper, we present fundamental insights and solution characterizationsthat include: (i) showing that the complexity of the problem remains high forany continuous and increasing rate function, (ii) formulating and provingsufficient and necessary optimality conditions of two base schedulingstrategies that correspond to emptying the queues using "one-at-a-time" or"all-at-once" strategies, (iii) presenting and proving the tractability of thespecial case in which the transmission rates are functions only of thecardinality of the link activation sets. These results are independent ofphysical-layer system specifications and are valid for any form of ratefunction. We then develop an algorithmic framework. The framework encompassesexact as well as sub-optimal, but fast, scheduling algorithms, all under aunified principle design. Through computational experiments we finallyinvestigate the performance of several specific algorithms.

Minimum-Length Scheduling with Finite Queues: Solution Characterization and Algorithmic Framework