An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays (Q3115649)
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: An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays |
scientific article; zbMATH DE number 6004917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm with bounds for the proportional case of a two-machine problem in flow-shop scheduling theory with minimum delays |
scientific article; zbMATH DE number 6004917 |
Statements
10 February 2012
0 references
completion time
0 references
relative error
0 references
0.8995435237884521
0 references
0.8580307960510254
0 references
0.8514102101325989
0 references
0.8294849395751953
0 references
