On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the optimality of the TLS algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines |
scientific article; zbMATH DE number 6197005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines |
scientific article; zbMATH DE number 6197005 |
Statements
On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (English)
0 references
9 August 2013
0 references
online scheduling
0 references
multipurpose machines
0 references
competitive analysis
0 references
makespan
0 references
algorithm \(TLS\)
0 references
0 references
0 references
0.8029417395591736
0 references
0.7880751490592957
0 references
0.7794396281242371
0 references
0.7767057418823242
0 references
