A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling (Q1210221): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: An Application of Bin-Packing to Multiprocessor Scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4131987 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tighter Bounds for the Multifit Processor Scheduling Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3940839 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02014582 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2922330763 / rank | |||
Normal rank | |||
Latest revision as of 10:35, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling |
scientific article |
Statements
A simple proof of the inequality \(R_ M(MF(k)) \leq 1.2 + (1/2^ k)\) in multiprocessor scheduling (English)
0 references
25 May 1993
0 references
scheduling
0 references
LPT-algorithm
0 references
