Best Compromise Solution for a New Multiobjective Scheduling Problem
2006 (English)In: Computers & Operations Research, ISSN 0305-0548, Vol. 33, no 8, 2353-2368 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2006. Vol. 33, no 8, 2353-2368 p.
Multiobjective optimization;Biobjective optimization;Assignment problem;Parallel machine scheduling;Telecommunications;Wireless networks
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-83660DOI: 10.1016/j.cor.2005.02.006ISI: 000235584900016OAI: oai:DiVA.org:kth-83660DiVA: diva2:498883
QC 201202272012-02-122012-02-122012-02-27Bibliographically approved