Greedy is optimal for online restricted assignment and smart grid scheduling for unit size jobs (Q5919098): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00224-021-10037-w / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3154943043 / rank | |||
Normal rank | |||
Revision as of 23:51, 19 March 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
