P2P B&B and GA for the Flow-Shop Scheduling Problem (Q3603121)
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: P2P B&B and GA for the Flow-Shop Scheduling Problem |
scientific article; zbMATH DE number 5508147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | P2P B&B and GA for the Flow-Shop Scheduling Problem |
scientific article; zbMATH DE number 5508147 |
Statements
P2P B&B and GA for the Flow-Shop Scheduling Problem (English)
0 references
13 February 2009
0 references
P2P computing
0 references
branch and bound
0 references
genetic algorithms
0 references
grid middleware
0 references
flow-shop scheduling
0 references
0 references
0 references
0.8749459
0 references
0.86943483
0 references
0 references
0.8617486
0 references
0.8605135
0 references
0.8597751
0 references
0.85850215
0 references
