Online Throughput Maximization on Unrelated Machines: Commitment is No Burden (Q6075745)
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 7753161
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Online Throughput Maximization on Unrelated Machines: Commitment is No Burden |
scientific article; zbMATH DE number 7753161 |
Statements
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden (English)
0 references
23 October 2023
0 references
deadline scheduling
0 references
throughput
0 references
online algorithms
0 references
competitive analysis
0 references
unrelated machines
0 references
migration
0 references
0 references
0 references
