Best compromise solution for a new multiobjective scheduling problem (Q2489291): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q109314959, #quickstatements; #temporary_batch_1706974288397 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q109314959 / rank | |||
Normal rank | |||
Revision as of 16:50, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Best compromise solution for a new multiobjective scheduling problem |
scientific article |
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
