Improved algorithm for a generalized on-line scheduling problem on identical machines (Q2432940): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Better Bounds for Online Scheduling / 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: New lower and upper bounds for on-line scheduling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line scheduling revisited / 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 on Multiprocessing Timing Anomalies / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On-line scheduling for jobs with arbitrary release times / rank | |||
Normal rank |
Latest revision as of 22:16, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improved algorithm for a generalized on-line scheduling problem on identical machines |
scientific article |
Statements
Improved algorithm for a generalized on-line scheduling problem on identical machines (English)
0 references
25 October 2006
0 references
scheduling
0 references
heuristic
0 references
on-line
0 references
list scheduling
0 references
competitive ratio
0 references
0 references