A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715)
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 computational study with a new algorithm for the three-machine permutation flow-shop problem with release times |
scientific article; zbMATH DE number 1620088
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times |
scientific article; zbMATH DE number 1620088 |
Statements
A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (English)
0 references
12 July 2001
0 references
permutation flow shop
0 references
makespan
0 references
release times
0 references
branch-and-bound algorithm
0 references
fuzzy search strategy
0 references
0 references
0 references
0 references
