Change search
ReferencesLink to record
Permanent link

Direct link
Best Compromise Solution for a New Multiobjective Scheduling Problem
University of Jyväskylä.
Helsinki School of Economics.
2006 (English)In: Computers & Operations Research, ISSN 0305-0548, Vol. 33, no 8, 2353-2368 p.Article in journal (Refereed) Published
Abstract [en]

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.
Keyword [en]
Multiobjective optimization;Biobjective optimization;Assignment problem;Parallel machine scheduling;Telecommunications;Wireless networks
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-83660DOI: 10.1016/j.cor.2005.02.006ISI: 000235584900016OAI: diva2:498883
QC 20120227Available from: 2012-02-12 Created: 2012-02-12 Last updated: 2012-02-27Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Miettinen, Kaisa
In the same journal
Computers & Operations Research
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 16 hits
ReferencesLink to record
Permanent link

Direct link