Best compromise solution for a new multiobjective scheduling problem (Q2489291)
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 5023542
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Best compromise solution for a new multiobjective scheduling problem |
scientific article; zbMATH DE number 5023542 |
Statements
Best compromise solution for a new multiobjective scheduling problem (English)
0 references
16 May 2006
0 references
Multiobjective optimization
0 references
Biobjective optimization
0 references
Assignment problem
0 references
Parallel machine scheduling
0 references
Telecommunications
0 references
Wireless networks
0 references
0 references
0 references
0.7488014698028564
0 references
0.7121763825416565
0 references
0.6929570436477661
0 references
0.6925438046455383
0 references
0.6914832592010498
0 references
