Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5919098): Difference between revisions
From MaRDI portal
Latest revision as of 17:54, 26 July 2024
scientific article; zbMATH DE number 7402290
Language | Label | Description | Also known as |
---|---|---|---|
English | Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs |
scientific article; zbMATH DE number 7402290 |
Statements
Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (English)
0 references
28 September 2021
0 references
optimal online algorithm
0 references
restricted assignment
0 references
smart grid scheduling
0 references
0 references
0 references
0 references