Improved analysis of two algorithms for min-weighted sum bin packing

DOI10.1007/978-3-031-34347-6_29arXiv2304.02498OpenAlexW4379117901MaRDI QIDQ6182919

Guillaume Sagnol

Publication date: 22 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmsbin packingbatch scheduling

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule
• Min-sum bin packing
• Approximating min sum set cover
• Batch scheduling of nonidentical job sizes with minsum criteria
• A survey of scheduling with parallel batch (p-batch) processing
• The Batch Loading and Scheduling Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Minimum Weighted Sum Bin Packing

This page was built for publication: Improved analysis of two algorithms for min-weighted sum bin packing