Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems

DOI10.1007/s10951-005-6814-0zbMath1123.90023OpenAlexW1994580849MaRDI QIDQ880502

Gianfranco Ciaschetti, Alessandro Agnetis, Paolo Detti

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-6814-0

zbMATH Keywords

multiprocessor schedulingpolynomial algorithmshigh-multiplicity

Mathematics Subject Classification ID

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

Related Items (4)

Optimal packet-to-slot assignment in mobile telecommunications ⋮ Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions ⋮ Packet scheduling in third-generation mobile systems with UTRA-TDD air interface ⋮ Number of bins and maximum lateness minimization in two-dimensional bin packing

Cites Work

• 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
• Unnamed Item

This page was built for publication: Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems