Minimizing total completion time for UET tasks with release time and outtree precedence constraints (Q2433242)
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 5068145
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing total completion time for UET tasks with release time and outtree precedence constraints |
scientific article; zbMATH DE number 5068145 |
Statements
Minimizing total completion time for UET tasks with release time and outtree precedence constraints (English)
0 references
27 October 2006
0 references
scheduling
0 references
parallel and identical machines
0 references
total completion time
0 references
outtree
0 references
preemptive scheduling
0 references
nonpreemptive scheduling
0 references
0.8350315093994141
0 references
0.8059768080711365
0 references
0.7865878343582153
0 references
0.7722949385643005
0 references
0.7722949385643005
0 references
