| Article ID: | iaor20102973 |
| Volume: | 37 |
| Issue: | 4 |
| Start Page Number: | 261 |
| End Page Number: | 264 |
| Publication Date: | Jul 2009 |
| Journal: | Operations Research Letters |
| Authors: | Agnetis Alessandro, Hurkens Cor, Detti Paolo, Ciaschetti Gianfranco |
| Keywords: | packet switching networks, telecommunications |
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.