Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489)
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 7554481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms |
scientific article; zbMATH DE number 7554481 |
Statements
Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (English)
0 references
8 July 2022
0 references
job scheduling
0 references
uniform machines
0 references
makespan
0 references
total completion time
0 references
approximation scheme
0 references
NP-hardness
0 references
incompatibility graph
0 references
0 references
0 references
0.8527318835258484
0 references
0.843879759311676
0 references
0.843879759311676
0 references
0.8415815830230713
0 references
