New algorithms for online rectangle filling with \(k\)-lookahead

DOI10.1007/S10878-009-9246-5zbMath1209.90307OpenAlexW1996806106MaRDI QIDQ626457

Amitabh Chaudhary, Haitao Wang, Danny Z. Chen

Publication date: 18 February 2011

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9246-5

zbMATH Keywords

competitive ratiochannel aware scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (3)

Semi-online scheduling with two GoS levels and unit processing time ⋮ An improved algorithm for online rectangle filling ⋮ Online rectangle filling

Cites Work

• Unnamed Item
• Scheduling resource allocation with timeslot penalty for changeover
• Throughput analysis in wireless networks with multiple users and multiple channels
• Exploiting Wireless Channel State Information for Throughput Maximization
• Online Rectangle Filling

This page was built for publication: New algorithms for online rectangle filling with \(k\)-lookahead