Journal
OPERATIONS RESEARCH LETTERS
Volume 37, Issue 4, Pages 261-264Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2009.03.005
Keywords
Multiprocessor scheduling; High multiplicity; Divisible sizes
Categories
Ask authors/readers for more resources
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. (C) 2009 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
