Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops (Q4033755)
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 166199
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops |
scientific article; zbMATH DE number 166199 |
Statements
Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops (English)
0 references
16 May 1993
0 references
fixed completion time
0 references
open shop
0 references
flow shop
0 references
mean job completion time
0 references
job preemption
0 references
polynomial algorithms
0 references
NP-hardness
0 references
0.8932902216911316
0 references
0.880300760269165
0 references
0.8701305389404297
0 references
0.8674870729446411
0 references
0.8667904734611511
0 references
