Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates
Sign Up to like & getrecommendations! Published in 2024 at "Algorithms"
DOI: 10.3390/a17070299
Abstract: We investigate relationships between scheduling problems with the bottleneck objective functions (minimising makespan or maximal lateness) and problems of optimal colourings of the mixed graphs. The investigated scheduling problems have integer durations of the multi-processor… read more here.
Keywords: processor tasks; mixed graph; integer due; scheduling problems ... See more keywords