| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143114 | Operations Research Letters | 2009 | 4 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Paolo Detti, Cor Hurkens, Alessandro Agnetis, Gianfranco Ciaschetti,