A new variable-sized bin packing problem

DOI10.1007/s10951-010-0199-4zbMath1280.92043OpenAlexW2060939489MaRDI QIDQ2434283

Joan. Boyar, Lene Monrad Favrholdt

Publication date: 5 February 2014

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

Full work available at URL: https://doi.org/10.1007/s10951-010-0199-4

zbMATH Keywords

variable-sized binsbins arriving on-lineon-line bin packingparallelization of BLAST jobs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Genetics and epigenetics (92D10)

Related Items (2)

Tight Bounds for Restricted Grid Scheduling ⋮ Bounds for Scheduling Jobs on Grid Processors

Uses Software

• mpiBLAST

Cites Work

• The relative worst-order ratio applied to paging
• Scheduling jobs on grid processors
• Competitive snoopy caching
• A new measure for the study of on-line algorithms
• Separating online scheduling algorithms with the relative worst order ratio
• Comparing First-Fit and Next-Fit for Online Edge Coloring
• Algorithm Theory - SWAT 2004
• Theoretical Evidence for the Superiority of LRU-2 over LRU for the Paging Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new variable-sized bin packing problem