Next-fit bin packing with random piece sizes

DOI10.2307/3214408zbMath0681.94002OpenAlexW2325743333MaRDI QIDQ4731123

Shlomo Halfin

Publication date: 1989

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214408

zbMATH Keywords

throughputnext- fit bin packing algorithmtime-slotted communication channelstransmission of data packets

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)

Related Items

Asymptotically optimal scheduling of random malleable demands in smart grid, Packings in two dimensions: Asymptotic average-case analysis of algorithms, Average-case analysis of cutting and packing in two dimensions