Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing

DOI10.1007/978-3-030-29400-7_8zbMath1437.68201arXiv1902.03428OpenAlexW2969769386MaRDI QIDQ3297564

Malin Rau, Klaus Jansen

Publication date: 20 July 2020

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (2)

Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms ⋮ Weighted completion time minimization for capacitated parallel machines

Cites Work

• Improved approximation algorithms for scheduling parallel jobs on identical clusters
• Scheduling parallel jobs on heterogeneous platforms
• On-line hierarchical job scheduling on grids with admissible allocation
• Online multiple-strip packing
• Rectangle packing with one-dimensional resource augmentation
• APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS
• Bounds for Multiprocessor Scheduling with Resource Constraints
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• Approximate algorithms to pack rectangles into several strips
• Parallel Processing and Applied Mathematics

This page was built for publication: Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing