A linear time approximation algorithm for permutation flow shop scheduling (Q764320)
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: A linear time approximation algorithm for permutation flow shop scheduling |
scientific article; zbMATH DE number 6014311
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time approximation algorithm for permutation flow shop scheduling |
scientific article; zbMATH DE number 6014311 |
Statements
A linear time approximation algorithm for permutation flow shop scheduling (English)
0 references
13 March 2012
0 references
permutation flow shop scheduling
0 references
approximation algorithms
0 references
Erdős-Szekeres theorem
0 references
0 references
0.8898148536682129
0 references
0.8849793076515198
0 references
0.8685607314109802
0 references
0.821018636226654
0 references
0.8193303346633911
0 references
