Minimizing total completion time in two-processor task systems with prespecified processor allocations (Q4390599)
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 1156575
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total completion time in two-processor task systems with prespecified processor allocations |
scientific article; zbMATH DE number 1156575 |
Statements
27 June 1999
0 references
worst-case analysis
0 references
scheduling multiprocessor tasks
0 references
prespecified processor locations
0 references
total completion time
0 references
two-processor problem
0 references
heuristic
0 references
Minimizing total completion time in two-processor task systems with prespecified processor allocations (English)
0 references
0.8416930437088013
0 references
0.8297609090805054
0 references
0.8297158479690552
0 references
0.8285787105560303
0 references
0.8194522261619568
0 references
