Minimizing total completion time in a two-machine flowshop: Analysis of special cases (Q2757616)
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 1677114
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing total completion time in a two-machine flowshop: Analysis of special cases |
scientific article; zbMATH DE number 1677114 |
Statements
26 November 2001
0 references
flowshop
0 references
total completion time
0 references
NP-hardness
0 references
heuristics
0 references
worst-case analysis
0 references
polynomial algorithm
0 references
Minimizing total completion time in a two-machine flowshop: Analysis of special cases (English)
0 references
