Minimizing flow time on a constant number of machines with preemption (Q1779706)
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 2173507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing flow time on a constant number of machines with preemption |
scientific article; zbMATH DE number 2173507 |
Statements
Minimizing flow time on a constant number of machines with preemption (English)
0 references
1 June 2005
0 references
Flow time
0 references
Approximation schemes
0 references
Multiple machines
0 references
Preemption
0 references
Scheduling
0 references
0 references
0.9084702134132384
0 references
0.8648255467414856
0 references
0.8610496520996094
0 references
0.8433274626731873
0 references
