New complexity results for shop scheduling problems with agreement graphs (Q2232609)
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: New complexity results for shop scheduling problems with agreement graphs |
scientific article; zbMATH DE number 7407472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New complexity results for shop scheduling problems with agreement graphs |
scientific article; zbMATH DE number 7407472 |
Statements
New complexity results for shop scheduling problems with agreement graphs (English)
0 references
6 October 2021
0 references
scheduling
0 references
complexity
0 references
flow shop
0 references
open shop
0 references
makespan
0 references
agreement graphs
0 references
0.8909982442855835
0 references
0.8522394895553589
0 references
0.8409044146537781
0 references
0.8401584029197693
0 references
0.8390374779701233
0 references
