A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
From MaRDI portal
Publication:967430
DOI10.1016/j.dam.2009.02.024zbMath1227.05234OpenAlexW2083664982MaRDI QIDQ967430
Krzysztof Giaro, Marek Kubale, Paweł Obszarski
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.02.024
Hypergraphs (05C65) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
On some applications of the selective graph coloring problem ⋮ Equitable coloring of hypergraphs ⋮ Graph multi-coloring for a job scheduling application ⋮ A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring ⋮ On the complexity of the selective graph coloring problem in some special classes of graphs ⋮ Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling
Cites Work
- Unnamed Item
- The complexity of scheduling independent two-processor tasks on dedicated processors
- Scheduling multiprocessor tasks -- An overview
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors
- Preemptive multiprocessor task scheduling with release times and time windows
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- Optimal parallel machines scheduling with availability constraints
- Concurrent Task Systems
- Reducibility among Combinatorial Problems
- Parallel Processing and Applied Mathematics
This page was built for publication: A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
