Title of article
Best compromise solution for a new multiobjective scheduling problem
Author/Authors
Anne Setamaa-Karkkainen، نويسنده , , Kaisa Miettinen، نويسنده , , Jarkko Vuori، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2006
Pages
16
From page
2353
To page
2368
Abstract
In future wireless networks, a mobile terminal will be able to communicate with a service provider using several network connections. These connections to networks will have different properties and they will be priced separately. In order to minimize the total communication time and the total transmission costs, an automatic method for selecting the network connections is needed. Here, we describe the network connection selection problem and formulate it mathematically. We discuss solving the problem and analyse different multiobjective optimization approaches for it.
Keywords
Parallel machine scheduling , Telecommunications , Multiobjective optimization , Biobjective optimization , Assignment problem , Wireless networks
Journal title
Computers and Operations Research
Serial Year
2006
Journal title
Computers and Operations Research
Record number
928767
Link To Document