SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS (Q3022006)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS |
scientific article; zbMATH DE number 2177791
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS |
scientific article; zbMATH DE number 2177791 |
Statements
SCHEDULING TO MINIMIZE MAX FLOW TIME: OFF-LINE AND ON-LINE ALGORITHMS (English)
0 references
22 June 2005
0 references
parallel machines scheduling
0 references
max flow time minimization
0 references
approximation algorithms
0 references
on-line and off-line algorithms
0 references
0 references
0.993032932281494
0 references
0.9226521849632264
0 references
0.850752055644989
0 references
0.8494529128074646
0 references
0.8484044075012207
0 references
