Optimal packet-to-slot assignment in mobile telecommunications

Authors:
Paolo Detti;Cor Hurkens;Alessandro Agnetis;Gianfranco Ciaschetti
Affiliations:
Dipartimento di Ingegneria dell'Informazione - Universití di Siena, Via Roma, 56, 53100, Siena, Italy;Department of Mathematics and Computer Science - Eindhoven University of Technology, PO Box 513, 5600MB, Eindhoven, The Netherlands;Dipartimento di Ingegneria dell'Informazione - Universití di Siena, Via Roma, 56, 53100, Siena, Italy;Dipartimento di Ingegneria dell'Informazione - Universití di Siena, Via Roma, 56, 53100, Siena, Italy
Venue:
Operations Research Letters
Year:
2009

Citing 6
Cited 0

Bin packing with divisible item sizes

Journal of Complexity
Wcdma for Umts

Wcdma for Umts
A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths

Mathematics of Operations Research
Polynomial Algorithms for a Two-Class Multiprocessor Scheduling Problem in Mobile Telecommunications Systems

Journal of Scheduling
Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions

Journal of Scheduling
Approximation of a retrieval problem for parallel disks

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

Quantified Score

Hi-index	0.00

Visualization

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.