Complexity of Scheduling Parallel Task Systems
From MaRDI portal
Publication:3832306
Recommendations
- On the complexity of multiprocessor task scheduling
- Scheduling parallel tasks with sequential heads and tails
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Scheduling UET task systems with concurrency on two parallel identical processors
- Scheduling preemptable tasks on parallel processors with limited availability
Cited in
(58)- A note on online strip packing
- Scheduling with semaphore constraints
- Parallel algorithms for redundant precedence relations elimination in task systems
- Scheduling multiprocessor tasks on three dedicated processors
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- Complexity of scheduling tasks with time-dependent execution times
- Real-time scheduling of linear speedup parallel tasks
- Efficiency and effectiveness of normal schedules on three dedicated processors
- Distributed processing of divisible jobs with communication startup costs
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- A note on scheduling multiprocessor tasks with identical processing times.
- Fairness in parallel job scheduling
- Linear and quadratic algorithms for scheduling chains and opposite chains
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
- Optimal workforce assignment to operations of a paced assembly line
- Scheduling parallel tasks with sequential heads and tails
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
- On the complexity of multiprocessor task scheduling
- Deadline scheduling of multiprocessor tasks
- Scheduling parallel jobs using migration and consolidation in the cloud
- Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
- Competitive online scheduling of perfectly malleable jobs with setup times
- A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
- scientific article; zbMATH DE number 1728441 (Why is no real title available?)
- APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
- Scheduling multiprocessor tasks on two parallel processors
- Scheduling malleable tasks with precedence constraints
- Complexity of Task Graph Scheduling with Fixed Communication Capacity
- On-line scheduling of parallel jobs
- Scheduling and stability aspects of a general class of parallel processing systems
- scientific article; zbMATH DE number 7650084 (Why is no real title available?)
- Bounding the running time of algorithms for scheduling and packing problems
- On-line scheduling of parallel jobs with runtime restrictions
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- Malleable scheduling beyond identical machines
- An improved approximation algorithm for scheduling monotonic moldable tasks
- Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
- On the complexity of scheduling problems with a fixed number of parallel identical machines
- Online multiple-strip packing
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds
- Scheduling moldable tasks on homogeneous multi-cluster platforms with GPUs
- List scheduling of parallel tasks
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
- Maximizing the throughput of parallel jobs on hypercubes
- Models and complexity of multibin packing problems
- On-line scheduling mesh jobs with dependencies
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- On the complexity of adjacent resource scheduling
- Scheduling parallel jobs to minimize the makespan
- Improved upper bounds for online malleable job scheduling
- On contiguous and non-contiguous parallel task scheduling
- On-line scheduling of parallel jobs in a list
This page was built for publication: Complexity of Scheduling Parallel Task Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3832306)
