An <i>O</i>(<i>n</i> log <i>n</i>) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds (Q4367053)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1091264
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An <i>O</i>(<i>n</i> log <i>n</i>) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds |
scientific article; zbMATH DE number 1091264 |
Statements
An <i>O</i>(<i>n</i> log <i>n</i>) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds (English)
0 references
14 January 1998
0 references
two-machine flow shop
0 references
varying machine speeds
0 references
dominance relation
0 references
0.8456084728240967
0 references
0.8393316268920898
0 references
0.8275148272514343
0 references
