The complexity of scheduling independent two-processor tasks on dedicated processors
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3857145 (Why is no real title available?)
- scientific article; zbMATH DE number 3918395 (Why is no real title available?)
- scientific article; zbMATH DE number 9845 (Why is no real title available?)
- Linear algorithms for edge-coloring trees and unicyclic graphs
- On Edge Coloring Bipartite Graphs
- On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Scheduling independent 2-processor tasks to minimize schedule length
- The NP-Completeness of Edge-Coloring
Cited in
(24)- Scheduling multiprocessor tasks on two parallel processors
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
- An approximation result for the interval coloring problem on claw-free chordal graphs
- Scheduling: agreement graph vs resource constraints
- Scheduling multiprocessor tasks on three dedicated processors
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- An approximation result for a duo-processor task scheduling problem
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Interval vertex-coloring of a graph with forbidden colors
- Scheduling independent tasks with multiple modes
- Efficiency and effectiveness of normal schedules on three dedicated processors
- Comparability graph augmentation for some multiprocessor scheduling problems
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Deadline scheduling of multiprocessor tasks
- Scheduling multiprocessor tasks -- An overview
- Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
- Consecutive edge-coloring of the generalized \(\theta \)-graph
- An approximation algorithm for scheduling on three dedicated machines
- Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors
- Lower bound algorithms for multiprocessor task scheduling with ready times
- Compact cyclic edge-colorings of graphs
- Complexity and approximation results for scheduling multiprocessor tasks on a ring.
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- On the complexity of adjacent resource scheduling
This page was built for publication: The complexity of scheduling independent two-processor tasks on dedicated processors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107984)
