The problem of assigning information packets of different services to time slots of a radio frame is addressed. Packet sizes are divisible, and a maximum time slot to which a packet can be assigned is given. We present a polynomial-time scheduling algorithm maximizing the number of scheduled packets
Abstract—This paper studies the problem of minimum delay scheduling in wireless networks with multi-...
We discuss a new approach for solving multiprocessor scheduling problems by using and improving resu...
AbstractWe consider a polynomial-time algorithm for the following scheduling problem: Given two mach...
The problem of assigning information packets of different services to time slots of a radio frame is...
The problem of assigning information packets of different services to time slots of a radio frame is...
The problem of assigning information packets of different services to time slots of a radio frame is...
[[abstract]]Chang and Lee develop two polynomial algorithms to find an optimal schedule under the co...
Real-time systems are those whose correctness depends not only on logical results of computations, b...
UTRA-TDD is one of the adopted air interfaces for third-generation mobile communication systems (UM...
[[abstract]]In this paper the process of data transmission in optical communication networks is mode...
The following multiprocessor scheduling problem was motivated by scheduling maintenance periods for ...
This thesis considers the problem of cross layer scheduling and radio resource allocation of multipl...
In this paper, we consider the optimal (i.e., minimum length) time slot assignment problem for varia...
A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is consider...
AbstractAew algorithms for transmission scheduling in multi-hop broadcast radio networks are present...
Abstract—This paper studies the problem of minimum delay scheduling in wireless networks with multi-...
We discuss a new approach for solving multiprocessor scheduling problems by using and improving resu...
AbstractWe consider a polynomial-time algorithm for the following scheduling problem: Given two mach...
The problem of assigning information packets of different services to time slots of a radio frame is...
The problem of assigning information packets of different services to time slots of a radio frame is...
The problem of assigning information packets of different services to time slots of a radio frame is...
[[abstract]]Chang and Lee develop two polynomial algorithms to find an optimal schedule under the co...
Real-time systems are those whose correctness depends not only on logical results of computations, b...
UTRA-TDD is one of the adopted air interfaces for third-generation mobile communication systems (UM...
[[abstract]]In this paper the process of data transmission in optical communication networks is mode...
The following multiprocessor scheduling problem was motivated by scheduling maintenance periods for ...
This thesis considers the problem of cross layer scheduling and radio resource allocation of multipl...
In this paper, we consider the optimal (i.e., minimum length) time slot assignment problem for varia...
A variant of the High Multiplicity Multiprocessor Scheduling Problem with C job lengths is consider...
AbstractAew algorithms for transmission scheduling in multi-hop broadcast radio networks are present...
Abstract—This paper studies the problem of minimum delay scheduling in wireless networks with multi-...
We discuss a new approach for solving multiprocessor scheduling problems by using and improving resu...
AbstractWe consider a polynomial-time algorithm for the following scheduling problem: Given two mach...
DOI
Add to ORKG