A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6580421
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines |
scientific article; zbMATH DE number 6580421 |
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
0 references
0 references
0.9227190017700196
0 references
0.9210832118988036
0 references
0.9171165227890016
0 references
0.8692182302474976
0 references
