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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases |
scientific article |
Statements
Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases (English)
0 references
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
