Online parallel batching scheduling for nonincreasing-processing-time jobs to minimize the maximum flow-time (Q4980804)
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 6311587
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online parallel batching scheduling for nonincreasing-processing-time jobs to minimize the maximum flow-time |
scientific article; zbMATH DE number 6311587 |
Statements
30 June 2014
0 references
on-line scheduling
0 references
parallel batching
0 references
maximum flow-time
0 references
competitive ratio
0 references
0.930299997329712
0 references
0.912990927696228
0 references
0.8946713805198669
0 references
0.8885511159896851
0 references
0.8761193752288818
0 references
