New lower and upper bounds for on-line scheduling (Q1892104): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: New lower and upper bounds for on-line scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3031924 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / 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 | |||
Revision as of 13:46, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New lower and upper bounds for on-line scheduling |
scientific article |
Statements
New lower and upper bounds for on-line scheduling (English)
0 references
6 July 1995
0 references
worst-case analysis
0 references
on-line scheduling a set of independent jobs
0 references
parallel and identical machines
0 references
0 references
