A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints

Authors:
K. Giaro;M. Kubale;P. Obszarski
Affiliations:
Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland;Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland;Department of Algorithms and System Modeling, Gdańsk University of Technology, Poland
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 5
Cited 1

The complexity of scheduling independent two-processor tasks on dedicated processors

Information Processing Letters
Scheduling multiprocessor tasks on three dedicated processors

Information Processing Letters
All-Cavity Maximum Matchings

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Optimal parallel machines scheduling with availability constraints

Discrete Applied Mathematics
Chromatic scheduling of 1- and 2-processor UET tasks on dedicated machines with availability constraints

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics

Selective graph coloring in some special classes of graphs

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.04

Visualization

Abstract

We address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem of optimal scheduling of sparse tree-like instances can be solved in polynomial time. However, if we admit dense instances then the problem becomes NP-hard, even if there are only two machines.