Minimizing makespan subject to minimum total flow-time on identical parallel machines (Q1580983)
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 1507981
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing makespan subject to minimum total flow-time on identical parallel machines |
scientific article; zbMATH DE number 1507981 |
Statements
Minimizing makespan subject to minimum total flow-time on identical parallel machines (English)
0 references
14 September 2000
0 references
parallel-machine scheduling
0 references
hierarchical criteria
0 references
makespan
0 references
flow-time
0 references
heuristic algorithms
0 references
empirical results
0 references
0.9848608
0 references
0.98061275
0 references
0.9731542
0 references
0.94224817
0 references
0.93477654
0 references
0 references
0.92471683
0 references
0 references
0.92212576
0 references
