scientific article; zbMATH DE number 1760037
From MaRDI portal
Publication:4536969
Recommendations
- Approximation schemes for scheduling on parallel machines
- Approximation algorithms for scheduling parallel jobs
- Approximation algorithms for general parallel task scheduling
- Parallel algorithms for solution of problems in scheduling theory
- A parallel approximation scheme for the multiprocessor scheduling problem
- Approximating scheduling unrelated parallel machines in parallel
- Sequential and parallel computations in the general scheduling problem
- scientific article; zbMATH DE number 1979517
- Approximation for scheduling on uniform nonsimultaneous parallel machines
Cited in
(21)- Parallel scheduling of recursively defined arrays: Revisited
- A parallel approximation scheme for the multiprocessor scheduling problem
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
- Parallel execution of schedules with random dependency graph
- Exact and approximate methods for parallel multiple-area spatial scheduling with release times
- Provable algorithms for parallel generalized sweep scheduling
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
- Parallel cooperative approaches for the labor constrained scheduling problem
- scientific article; zbMATH DE number 6006722 (Why is no real title available?)
- Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- scientific article; zbMATH DE number 4049080 (Why is no real title available?)
- A Heuristic of Scheduling Parallel Tasks and Its Analysis
- Approximation algorithms for scheduling arithmetic expressions on pipelined machines
- scientific article; zbMATH DE number 1206104 (Why is no real title available?)
- scientific article; zbMATH DE number 2011855 (Why is no real title available?)
- Computational Science and Its Applications – ICCSA 2004
- Approximating scheduling unrelated parallel machines in parallel
- Isomorphic scheduling problems
- Scheduling parallel jobs to minimize the makespan
- Proportional scheduling, split-proofness, and merge-proofness
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536969)
