Online scheduling with one rearrangement at the end: revisited (Q456073): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W27 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68W40 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6098058 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling problems | |||
| Property / zbMATH Keywords: scheduling problems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
competitive ratio | |||
| Property / zbMATH Keywords: competitive ratio / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
online algorithms | |||
| Property / zbMATH Keywords: online algorithms / rank | |||
Normal rank | |||
Revision as of 12:37, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Online scheduling with one rearrangement at the end: revisited |
scientific article |
Statements
Online scheduling with one rearrangement at the end: revisited (English)
0 references
23 October 2012
0 references
scheduling problems
0 references
competitive ratio
0 references
online algorithms
0 references
