Shortest common superstrings and scheduling with coordinated starting times (Q1127327)
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 1189641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Shortest common superstrings and scheduling with coordinated starting times |
scientific article; zbMATH DE number 1189641 |
Statements
Shortest common superstrings and scheduling with coordinated starting times (English)
0 references
13 August 1998
0 references
superstrings
0 references
flow-shop
0 references
job-shop
0 references
NP-completeness
0 references
shortest common superstring problem
0 references
0 references
0.8190041780471802
0 references
0.7747700214385986
0 references
0.7537642121315002
0 references
0.7490208148956299
0 references
