Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms (Q2152489)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms |
scientific article |
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
