A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10951-015-0460-y / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2285763352 / rank | |||
Normal rank | |||
Revision as of 18:18, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines |
scientific article |
Statements
A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (English)
0 references
13 May 2016
0 references
multi-agent scheduling
0 references
identical machines
0 references
makespan
0 references
approximation algorithm
0 references
performance ratio vector
0 references
