An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop (Q4717402)
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 asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop |
scientific article; zbMATH DE number 952413
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop |
scientific article; zbMATH DE number 952413 |
Statements
An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop (English)
0 references
1 December 1996
0 references
two-machine flow-shop scheduling
0 references
total flow time
0 references
lower bound
0 references
branch-and-bound
0 references
two-phase heuristic algorithm
0 references
0.9236268
0 references
0.92029715
0 references
0.9166022
0 references
0.9106332
0 references
0.9106214
0 references
0.91018164
0 references
0.9098363
0 references
0.9098363
0 references
