A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:59, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem |
scientific article |
Statements
A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (English)
0 references
25 June 2019
0 references
two identical parallel machines scheduling
0 references
makespan
0 references
LPT rule
0 references
mathematical programming
0 references
approximation
0 references
