A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707)
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 polynomial time approximation scheme for the two-stage multiprocessor flow shop problem |
scientific article; zbMATH DE number 1454556
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem |
scientific article; zbMATH DE number 1454556 |
Statements
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (English)
0 references
4 June 2000
0 references
flow shop
0 references
job shop
0 references
scheduling
0 references
worst-case analysis
0 references
approximation algorithm
0 references
polynomial time approximation scheme
0 references
0 references
0.96520644
0 references
0 references
0.9319428
0 references
0.9292316
0 references
0.9164007
0 references
0.91155136
0 references
0.9101944
0 references
0.90994716
0 references
