A three-machine permutation flow-shop problem with minimum makespan on the second machine (Q3378829)
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 three-machine permutation flow-shop problem with minimum makespan on the second machine |
scientific article; zbMATH DE number 5017212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A three-machine permutation flow-shop problem with minimum makespan on the second machine |
scientific article; zbMATH DE number 5017212 |
Statements
A three-machine permutation flow-shop problem with minimum makespan on the second machine (English)
0 references
4 April 2006
0 references
multicriteria scheduling
0 references
hierarchical criteria
0 references
flow-shop scheduling
0 references
branch-and-bound algorithm
0 references
0.8459482789039612
0 references
0.8412140011787415
0 references
0.8314054608345032
0 references
0.8308164477348328
0 references
