Chromatic scheduling (Q2822599)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6632115
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chromatic scheduling |
scientific article; zbMATH DE number 6632115 |
Statements
30 September 2016
0 references
colouring
0 references
co-colouring
0 references
vertex-colouring
0 references
edge-colouring
0 references
0.9231449
0 references
0.8990095
0 references
0.8938978
0 references
0.8899956
0 references
0.88774663
0 references
0.87342596
0 references
0.8712473
0 references
Chromatic scheduling (English)
0 references
Variations and extensions of the basic vertex-colouring and edge-colouring models have been developed to deal with increasingly complex scheduling problems. They are presented and illustrated in specific situations where additional requirements are imposed. List colouring, mixed graph colouring, co-colouring, colouring with preferences and bandwidth colouring are included, and applications of edge colouring to open shop, school timetabling and sports scheduling problems are presented. Balancing and compactness constraints which often appear in practical situations are also discussed.NEWLINENEWLINEFor the entire collection see [Zbl 1317.05004].
0 references
