Optimal packet-to-slot assignment in mobile telecommunications

DOI10.1016/j.orl.2009.03.005zbMath1167.90506OpenAlexW2089623913MaRDI QIDQ833596

Alessandro Agnetis, Paolo Detti, Gianfranco Ciaschetti, Cor A. J. Hurkens

Publication date: 14 August 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.03.005

zbMATH Keywords

multiprocessor schedulinghigh multiplicitydivisible sizes

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Scheduling on a single machine under time-of-use electricity tariffs

Cites Work

• Unnamed Item
• Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions
• Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems
• Bin packing with divisible item sizes
• A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths
• On Scheduling Independent Tasks with Restricted Execution Times
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem

This page was built for publication: Optimal packet-to-slot assignment in mobile telecommunications