Approximation algorithms for scheduling independent malleable tasks
From MaRDI portal
Recommendations
- A \frac32‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- scientific article; zbMATH DE number 1003247
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- scientific article; zbMATH DE number 1241387
- Linear-Time approximation schemes for scheduling malleable parallel tasks
Cited in
(12)- A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
- Competitive online scheduling of perfectly malleable jobs with setup times
- Scheduling malleable tasks with interdependent processing rates: comments and observations
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS
- An effective approximation algorithm for the malleable parallel task scheduling problem
- A \frac32‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- On symbolic scheduling independent tasks with restricted execution times
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
- Algorithms for scheduling deadline-sensitive malleable tasks
- Fast exact and approximate algorithms for k-partition and scheduling independent tasks
This page was built for publication: Approximation algorithms for scheduling independent malleable tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791892)