Time complexity and linear-time approximation of the ancient two-machine flow shop (Q1268836)
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: Time complexity and linear-time approximation of the ancient two-machine flow shop |
scientific article; zbMATH DE number 1216802
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time complexity and linear-time approximation of the ancient two-machine flow shop |
scientific article; zbMATH DE number 1216802 |
Statements
Time complexity and linear-time approximation of the ancient two-machine flow shop (English)
0 references
1 November 1998
0 references
flow shop
0 references
no wait in progress
0 references
computational complexity
0 references
algebraic computation tree
0 references
lower bounds
0 references
makespan minimization
0 references
two-machine flow shop
0 references
approximation algorithms
0 references
0.89712876
0 references
0.8948373
0 references
0.89278936
0 references
0.8888679
0 references
0.8825593
0 references
0.88167244
0 references
0.88155574
0 references
