Best compromise solution for a new multiobjective scheduling problem

Best compromise solution for a new multiobjective scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor20071736
Country: United Kingdom
Volume: 33
Issue: 8
Start Page Number: 2353
End Page Number: 2368
Publication Date: Aug 2006
Journal: Computers and Operations Research
Authors: , ,
Keywords: communication, programming: multiple criteria
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.

Reviews

Required fields are marked *. Your email address will not be published.