Minimizing total completion time in a two-machine flowshop: Analysis of special cases (Q4645936)
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: Minimizing total completion time in a two-machine flowshop: Analysis of special cases |
scientific article; zbMATH DE number 7000362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total completion time in a two-machine flowshop: Analysis of special cases |
scientific article; zbMATH DE number 7000362 |
Statements
Minimizing total completion time in a two-machine flowshop: Analysis of special cases (English)
0 references
11 January 2019
0 references
flowshop
0 references
total completion time
0 references
\(\mathcal{NP}\)-hardness
0 references
heuristics
0 references
worst-case analysis
0 references
special cases
0 references
polynomial algorithms
0 references
0 references
1.0000002
0 references
0.94683135
0 references
0.94050944
0 references
0.94050944
0 references
0.9363417
0 references
0.93564606
0 references
0.93318266
0 references
0.93080735
0 references
0.92680156
0 references
