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

Authors:
Krzysztof Giaro;Marek Kubale
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
Venue:
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Year:
2005

Citing 8
Cited 1

An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems

IEEE Transactions on Computers
Parallel processing: the Cm* experience

Parallel processing: the Cm* experience
The complexity of scheduling independent two-processor tasks on dedicated processors

Information Processing Letters
Scheduling multiprocessor tasks on three dedicated processors

Information Processing Letters
Edge-chromatic sum of trees and bounded cyclicity graphs

Information Processing Letters
All-Cavity Maximum Matchings

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Algorithm for the Cost Edge-Coloring of Trees

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Optimal parallel machines scheduling with availability constraints

Discrete Applied Mathematics

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

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We address a generalization of the classical 1- and 2-processor UET 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 constraints we show that the problem of optimal scheduling of sparse instances can be solved in polynomial time.