Scheduling Multiprocessor Tasks to Minimize Schedule Length
From MaRDI portal
Recommendations
Cited in
(89)- Scheduling multiprocessor UET tasks of two sizes
- Scheduling tasks on two processors with deadlines and additional resources
- Minimizing mean flow time with parallel processors and resource constraints
- Scheduling with semaphore constraints
- New trends in machine scheduling
- The complexity of scheduling independent two-processor tasks on dedicated processors
- Production scheduling problems in a textile industry
- Deterministic multiprocessor scheduling with multiple objectives
- Scheduling multiprocessor tasks on three dedicated processors
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- A relation between multiprocessor scheduling and linear programming
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- Minimizing the schedule length for a parallel 3D-grid precedence graph
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- 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
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- A note on scheduling multiprocessor tasks with identical processing times.
- Complexity and approximation results for scheduling multiprocessor tasks on a ring.
- 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 chained multiprocessor tasks onto large multiprocessor system
- Efficiency of the methods of scheduling complex sets of tasks in nonuniform multiprocessor computer systems
- An efficient load distribution strategy for a distributed linear network of processors with communication delays
- Scheduling parallel tasks with sequential heads and tails
- Scheduling of resource tasks
- Non-preemptive scheduling to maximize the minimum global inter-completion time
- Scheduling multiprocessor tasks on hypercubes
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
- The optimal control approach to generalized multiprocessor scheduling
- On the complexity of multiprocessor task scheduling
- Deadline scheduling of multiprocessor tasks
- Scheduling multiprocessor tasks for mean flow time criterion
- Packing-based branch-and-bound for discrete malleable task scheduling
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Some algorithms of solving minimax multiprocessor scheduling problem
- Shared processor scheduling of multiprocessor jobs
- Nonpreemptive scheduling of arbitrary machines
- A polynomial algorithm for multiprocessor scheduling with two job lengths.
- A note on scheduling multiprocessor tasks with precedence constraints on parallel processors
- Scheduling multiprocessor tasks on two parallel processors
- An online scheduling of two type parallel jobs on identical machines
- A two-leveled approach for multiprocessor tasks assignment in a distributed computing environment
- Scheduling Multipipeline and Multiprocessor Computers
- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
- scientific article; zbMATH DE number 3991267 (Why is no real title available?)
- Two processor scheduling with limited preemption
- scientific article; zbMATH DE number 4072695 (Why is no real title available?)
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
- Complexity of Scheduling Parallel Task Systems
- New bounds on time and number of processors for multiprocessor optimal schedules
- scientific article; zbMATH DE number 1271325 (Why is no real title available?)
- An effective approximation algorithm for the malleable parallel task scheduling problem
- Minimizing total completion time in two-processor task systems with prespecified processor allocations
- scientific article; zbMATH DE number 1157215 (Why is no real title available?)
- scientific article; zbMATH DE number 1529456 (Why is no real title available?)
- A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs
- Ordonnancement de tâches sur un système multiprocesseur - modèles déterministes et modèles stochastiques
- scientific article; zbMATH DE number 1416512 (Why is no real title available?)
- On-line scheduling of parallel jobs
- Scheduling DAGs with random parallel tasks on binarily partitionable systems
- scientific article; zbMATH DE number 962288 (Why is no real title available?)
- Bounding the running time of algorithms for scheduling and packing problems
- The complexity of path coloring and call scheduling
- Efficient construction of minimum makespan schedules for tasks with a fixed number of distinct execution times
- New applications of the Muntz and Coffman algorithm
- Scheduling independent multiprocessor tasks
- On-line scheduling of parallel jobs with runtime restrictions
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- Scheduling independent multiprocessor tasks
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times
- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
- Mixed satisfiability tests for multiprocessor scheduling with release dates and deadlines.
- Scheduling independent two processor tasks on a uniform duo-processor system
- List scheduling of parallel tasks
- Scheduling independent 2-processor tasks to minimize schedule length
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications
- Models and complexity of multibin packing problems
- A simple linear time approximation algorithm for multi-processor job scheduling on four processors
- 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
This page was built for publication: Scheduling Multiprocessor Tasks to Minimize Schedule Length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3741047)
