A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines (Q283263): Difference between revisions
From MaRDI portal
Latest revision as of 23:14, 11 July 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
0 references
0 references