A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) (Q2819575): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Jian'er Chen / rank | |||
| Property / author | |||
| Property / author: Jian'er Chen / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/301250.301363 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2106177605 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) |
scientific article |
Statements
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract) (English)
0 references
29 September 2016
0 references
