Log in to save to my catalogue

Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks w...

Mixed Graph Colouring as Scheduling a Partially Ordered Set of Interruptible Multi-Processor Tasks w...

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_039bfe99df4f405591b800b75cdeaad4

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

About this item

Full title

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

Publisher

Basel: MDPI AG

Journal title

Algorithms, 2024-07, Vol.17 (7), p.299

Language

English

Formats

Publication information

Publisher

Basel: MDPI AG

More information

Scope and Contents

Contents

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), integer release dates and integer due dates of the g...

Alternative Titles

Full title

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

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_doaj_primary_oai_doaj_org_article_039bfe99df4f405591b800b75cdeaad4

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_039bfe99df4f405591b800b75cdeaad4

Other Identifiers

ISSN

1999-4893

E-ISSN

1999-4893

DOI

10.3390/a17070299

How to access this item