A lower bound for randomized on-line multiprocessor scheduling (Q287130): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W20 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68W27 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6585441 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
combinatorial problems | |||
Property / zbMATH Keywords: combinatorial problems / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
online algorithms | |||
Property / zbMATH Keywords: online algorithms / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
randomization | |||
Property / zbMATH Keywords: randomization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
scheduling | |||
Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
worst-case bounds | |||
Property / zbMATH Keywords: worst-case bounds / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New algorithms for an ancient scheduling problem. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A better lower bound for on-line scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A lower bound for randomized on-line scheduling algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An optimal algorithm for preemptive on-line scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3031924 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An On-Line Scheduling Heuristic with Better Worst-Case Ratio Than Graham’s List Scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4335203 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00093-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1999476761 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:21, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A lower bound for randomized on-line multiprocessor scheduling |
scientific article |
Statements
A lower bound for randomized on-line multiprocessor scheduling (English)
0 references
26 May 2016
0 references
combinatorial problems
0 references
online algorithms
0 references
randomization
0 references
scheduling
0 references
worst-case bounds
0 references
0 references