Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times (Q2861538)
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 6224301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times |
scientific article; zbMATH DE number 6224301 |
Statements
8 November 2013
0 references
Polynomial lower bounds for the two-machine flowshop problem with sequence-independent setup times (English)
0 references
0.9116966724395752
0 references
0.8667087554931641
0 references
0.8573480844497681
0 references
0.8475288152694702
0 references
