Optimally Handling Commitment Issues in Online Throughput Maximization (Q5874511)
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 7651180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimally Handling Commitment Issues in Online Throughput Maximization |
scientific article; zbMATH DE number 7651180 |
Statements
7 February 2023
0 references
deadline scheduling
0 references
throughput
0 references
online algorithms
0 references
competitive analysis
0 references
Optimally Handling Commitment Issues in Online Throughput Maximization (English)
0 references
0 references
0.9695481
0 references
0.9695481
0 references
0.91011477
0 references
0.8768714
0 references
0.8578781
0 references
0 references
0.85438097
0 references
0.85438097
0 references
0.8539145
0 references
