A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem (Q2424829)
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 7073200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem |
scientific article; zbMATH DE number 7073200 |
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
0 references
0.9386702
0 references
0.92482275
0 references
0.8948219
0 references
0.8920872
0 references
0.8858543
0 references
0.8843321
0 references
0.8770337
0 references
