期刊
OPERATIONS RESEARCH LETTERS
卷 37, 期 4, 页码 261-264出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2009.03.005
关键词
Multiprocessor scheduling; High multiplicity; Divisible sizes
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据