On the approximability of multiprocessor task scheduling problems
From MaRDI portal
Recommendations
- A polynomial time approximation scheme for general multiprocessor job scheduling
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
- Polynomial time approximation schemes for general multiprocessor job shop scheduling
- Polynomial time approximation schemes for general multiprocessor job shop scheduling
- scientific article; zbMATH DE number 2185607
Cited in
(37)- On the worst-case ratio of a compound multiprocessor scheduling algorithm
- On a scheduling problem where a job can be executed only by a limited number of processors
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- Complexity and approximation results for scheduling multiprocessor tasks on a ring.
- A parallel approximation scheme for the multiprocessor scheduling problem
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
- An LPT-bound for a parallel multiprocessor scheduling problem
- Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
- A polynomial time approximation scheme for general multiprocessor job scheduling
- ILP formulations for scheduling ordered tasks on a bounded number of processors
- A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
- Scheduling in the presence of processor networks : complexity and approximation
- Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times
- scientific article; zbMATH DE number 1824251 (Why is no real title available?)
- scientific article; zbMATH DE number 3885635 (Why is no real title available?)
- Tighter Bounds for the Multifit Processor Scheduling Algorithm
- The Research of Method Based on Complex Multi-task Parallel Scheduling Problem
- Lower bound algorithms for multiprocessor task scheduling with ready times
- APPROXIMATE AND EXACT ALGORITHMS FOR SCHEDULING INDEPENDENT TASKS ON UNRELATED PROCESSORS
- scientific article; zbMATH DE number 67289 (Why is no real title available?)
- Approximation Algorithms For Scheduling On Uniform Processors
- Approximation algorithms for scheduling arithmetic expressions on pipelined machines
- Approximating scheduling problems in parallel
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- On minimising the processor requirements of \(\text{Log} \text{P}\) schedules
- Polynomial time approximation schemes for general multiprocessor job shop scheduling
- Non-approximability of the bulk synchronous task scheduling problem
- scientific article; zbMATH DE number 6160333 (Why is no real title available?)
- General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
- Provably good multiprocessor scheduling with resource sharing
- Fast exact and approximate algorithms for k-partition and scheduling independent tasks
- On multiprocessor task scheduling using efficient state space search approaches
- Partial solutions and multifit algorithm for multiprocessor scheduling
- Proportional scheduling, split-proofness, and merge-proofness
This page was built for publication: On the approximability of multiprocessor task scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427861)
