Approximation algorithms for scheduling parallel jobs
From MaRDI portal
Recommendations
- Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
- scientific article; zbMATH DE number 1241387
- Improved Approximation Schemes for Scheduling Unrelated Parallel Machines
- Approximation algorithms for general parallel task scheduling
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
Cited in
(37)- Approximate algorithms for the \(P\parallel C_{\max}\) problem
- Approximation algorithms for general parallel task scheduling
- A parallel approximation scheme for the multiprocessor scheduling problem
- Scheduling under the network of temporo-spatial proximity relationships
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
- Job release scheduling problem: complexity and an approximation algorithm
- Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
- Approximation algorithms for two-stage flexible flow shop scheduling
- Online scheduling of moldable parallel tasks
- Simultaneous approximation ratios for parallel machine scheduling problems
- Provable algorithms for parallel generalized sweep scheduling
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
- Approximating the non-contiguous multiple organization packing problem
- A New Approximation Algorithm for the Nonpreemptive Scheduling of Independent Jobs on Identical Parallel Processors
- Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- A (5/3+)-approximation for strip packing
- Approximation algorithms for scheduling arithmetic expressions on pipelined machines
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- scientific article; zbMATH DE number 1760037 (Why is no real title available?)
- Improved approximation algorithms for scheduling parallel jobs on identical clusters
- Closing the Gap for Pseudo-Polynomial Strip Packing
- Scheduling parallel jobs on heterogeneous platforms
- Handling precedence constraints in scheduling problems by the sequence pair representation
- Scheduling partially ordered jobs faster than \(2^n\)
- scientific article; zbMATH DE number 7650084 (Why is no real title available?)
- Bounding the running time of algorithms for scheduling and packing problems
- Approximation and Online Algorithms
- Peak demand minimization via sliced strip packing
- Malleable scheduling beyond identical machines
- An improved approximation algorithm for scheduling monotonic moldable tasks
- Efficient approximation algorithms for scheduling moldable tasks
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds
- Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs
- Scheduling parallel jobs to minimize the makespan
This page was built for publication: Approximation algorithms for scheduling parallel jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5390607)
