Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (Q3430246)
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 5135903
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm |
scientific article; zbMATH DE number 5135903 |
Statements
Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm (English)
0 references
21 March 2007
0 references
scheduling
0 references
multimedia
0 references
world wide web
0 references
flowshop
0 references
maximum lateness
0 references
dominance relations
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7322593331336975
0 references
0.7223056554794312
0 references
0.7163545489311218
0 references
0.7160121202468872
0 references
0.7146185636520386
0 references
