Algorithms better than LPT for semi-online scheduling with decreasing processing times (Q1758275): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Optimal non-preemptive semi-online scheduling on two related machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3031924 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line scheduling revisited / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semi-online scheduling with decreasing job sizes / rank | |||
Normal rank |
Latest revision as of 21:13, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithms better than LPT for semi-online scheduling with decreasing processing times |
scientific article |
Statements
Algorithms better than LPT for semi-online scheduling with decreasing processing times (English)
0 references
8 November 2012
0 references
online algorithms
0 references
semi-online algorithms
0 references
competitive ratio
0 references
multiprocessor scheduling
0 references