Concurrent Task Systems
From MaRDI portal
Cited in
(23)- Scheduling with semaphore constraints
- Linear and quadratic algorithms for scheduling chains and opposite chains
- Scheduling multiprocessor tasks on two parallel processors
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
- A note on scheduling multiprocessor tasks with precedence constraints on parallel processors
- On maximizing the throughput of multiprocessor tasks.
- Idle regulation in non-clairvoyant scheduling of parallel jobs
- Optimal workforce assignment to operations of a paced assembly line
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- Scheduling DAGs with random parallel tasks on binarily partitionable systems
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- On contiguous and non-contiguous parallel task scheduling
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- Scheduling multiprocessor UET tasks of two sizes
- Greed in resource scheduling
- A note on scheduling multiprocessor tasks with identical processing times.
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- Performance of critical path type algorithms for scheduling on parallel processors
- Packing-based branch-and-bound for discrete malleable task scheduling
- The price of anarchy for a berth allocation game
This page was built for publication: Concurrent Task Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914443)
