Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints |
scientific article |
Statements
Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (English)
0 references
4 January 2023
0 references
parallel dedicated machines
0 references
conflict graph
0 references
approximation algorithm
0 references
NP-hard
0 references
0 references
