Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms

DOI10.1007/s10951-022-00774-2zbMath1520.90133OpenAlexW4317941026MaRDI QIDQ6136082

Run Zhang, Zhongyi Jiang, Xiandong Zhang, Fangfang Wu

Publication date: 28 August 2023

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

Full work available at URL: https://doi.org/10.1007/s10951-022-00774-2

zbMATH Keywords

schedulingapproximation algorithmmultiple platformsmoldable tasksdual approximation algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Improved approximation algorithms for scheduling parallel jobs on identical clusters
• Scheduling parallel jobs on heterogeneous platforms
• Scheduling parallel jobs to minimize the makespan
• Scheduling for parallel processing
• Linear-Time approximation schemes for scheduling malleable parallel tasks
• Optimal workforce assignment to operations of a paced assembly line
• The Multiple Subset Sum Problem
• APPROXIMATION ALGORITHMS FOR MULTIPLE STRIP PACKING AND SCHEDULING PARALLEL JOBS IN PLATFORMS
• Approximating the Non-contiguous Multiple Organization Packing Problem
• Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing
• On-Line Multiple-Strip Packing
• Complexity of Scheduling Parallel Task Systems
• The Parallel Evaluation of General Arithmetic Expressions
• Closing the Gap for Pseudo-Polynomial Strip Packing
• A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• Approximation Algorithms for Scheduling Parallel Jobs
• Approximate algorithms to pack rectangles into several strips
• Parallel Processing and Applied Mathematics
• An improved approximation algorithm for scheduling monotonic moldable tasks

This page was built for publication: Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms