A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (Q2931730): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:15, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES |
scientific article |
Statements
A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES (English)
0 references
26 November 2014
0 references
scheduling
0 references
online algorithm
0 references
parallel batch
0 references
maximum flow-time
0 references
competitive ratio
0 references
