A lower bound for randomized on-line multiprocessor scheduling (Q287130): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 02:07, 12 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