Best compromise solution for a new multiobjective scheduling problem (Q2489291): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2005.02.006 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2005.02.006 / rank | |||
Normal rank | |||
Latest revision as of 23:43, 18 December 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
0 references
