Tight Bounds for Restricted Grid Scheduling

DOI10.1142/S0129054119500102zbMath1415.68266arXiv1404.7325OpenAlexW2805215296MaRDI QIDQ5384122

Faith Ellen, Joan. Boyar

Publication date: 21 June 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.7325

zbMATH Keywords

online algorithmsvariable-sized bin packingrestricted grid scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Uses Software

• mpiBLAST

Cites Work

• Unnamed Item
• Unnamed Item
• Online variable-sized bin packing with conflicts
• A new version of on-line variable-sized bin packing
• More on online bin packing with two item sizes
• Scheduling jobs on grid processors
• Competitive snoopy caching
• A lower bound for on-line bin packing
• A new variable-sized bin packing problem

This page was built for publication: Tight Bounds for Restricted Grid Scheduling