QR Code

Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks with Integer Due Dates

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 tasks (operations), in...

Full description

Saved in:
Main Authors: Evangelina I. Mihova, Yuri N. Sotskov
Format: Artigo
Language:Inglês
Published: MDPI AG 2024-07-01
Series:Algorithms
Subjects:
scheduling
maximal lateness
makespan
multi-processor task
mixed graph colouring
Online Access:https://www.mdpi.com/1999-4893/17/7/299
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items