Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (Q1790974)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Approximation algorithms for two-machine flow-shop scheduling with a conflict graph |
scientific article; zbMATH DE number 6946788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms for two-machine flow-shop scheduling with a conflict graph |
scientific article; zbMATH DE number 6946788 |
Statements
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph (English)
0 references
4 October 2018
0 references
flow-shop scheduling
0 references
conflict graph
0 references
\(b\)-matching
0 references
path cover
0 references
approximation algorithm
0 references
