On the Complexity of Mean Flow Time Scheduling (Q4187560)
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 3625095
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of Mean Flow Time Scheduling |
scientific article; zbMATH DE number 3625095 |
Statements
On the Complexity of Mean Flow Time Scheduling (English)
0 references
1977
0 references
Mean Flow Time Scheduling
0 references
Identical Parallel Machines
0 references
Np-Complete
0 references
Series-Parallel Precedence Constraints
0 references
Computational Complexity
0 references
Tree- Like Precedence Constraints
0 references
