A multi-stage parallel-processor flowshop problem with minimum flowtime (Q1197966)
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: A multi-stage parallel-processor flowshop problem with minimum flowtime |
scientific article; zbMATH DE number 92054
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A multi-stage parallel-processor flowshop problem with minimum flowtime |
scientific article; zbMATH DE number 92054 |
Statements
A multi-stage parallel-processor flowshop problem with minimum flowtime (English)
0 references
16 January 1993
0 references
flowshop scheduling
0 references
total flowtime
0 references
branch-and-bound
0 references
parallel processors
0 references
NP-complete
0 references
heuristic algorithm
0 references
two-stage parallel- processor flowshop
0 references
0.9097204
0 references
0.9072496
0 references
0.90641904
0 references
0.9041139
0 references
0.9005831
0 references
0.8996618
0 references
0.8968631
0 references
0.8920066
0 references
0.8916391
0 references
