Efficient approximation algorithms for scheduling moldable tasks
From MaRDI portal
Publication:6113310
DOI10.1016/j.ejor.2023.02.044MaRDI QIDQ6113310
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Scheduling malleable tasks on parallel processors to minimize the makespan
- Maximizing the total profit of rectangles packed into a rectangle
- Improved upper bounds for online malleable job scheduling
- On the complexity of the shortest-path broadcast problem
- Online scheduling of malleable parallel jobs with setup times on two identical machines
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Real-time scheduling of linear speedup parallel tasks
- Scheduling parallel jobs online with convex and concave parallelizability
- Competitive online scheduling of perfectly malleable jobs with setup times
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- A Heuristic of Scheduling Parallel Tasks and Its Analysis
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Approximation Algorithms for Scheduling Parallel Jobs
- Mathematical Foundations of Computer Science 2005
- Resilient Scheduling of Moldable Parallel Jobs to Cope With Silent Errors
- An improved approximation algorithm for scheduling monotonic moldable tasks
This page was built for publication: Efficient approximation algorithms for scheduling moldable tasks
